Given a array int a[]={2,5,1,9,3,7,2,8,9,3} and the no. of swap operations.We are allowed to do swap operations.

swap constraint: exchange only adjacent element.

Find the max number that can be formed using swap operations. Fab.com

Example : 2 ,5,8,7,9 and N=2 , so only two swap operation can be performed.

output : 8,2,5,7,9