by far worst problem in terms of requirements. seriously, it's so counterintuitive to do it 'the wrong way' instead of just implementing plain insert sort with printout each time values are swapped

solving the problem - 5 minutes

printing to output the way author wanted - 55 minutes

The test case 2 is failing.Not sure what's the issue.Below is the output.Did anyone face the same issue.

2 3 4 5 6 7 8 9 10 10

2 3 4 5 6 7 8 9 9 10

2 3 4 5 6 7 8 8 9 10

2 3 4 5 6 7 7 8 9 10

2 3 4 5 6 6 7 8 9 10

2 3 4 5 5 6 7 8 9 10

2 3 4 4 5 6 7 8 9 10

2 3 3 4 5 6 7 8 9 10

2 2 3 4 5 6 7 8 9 10

1 2 3 4 5 6 7 8 9 10

Stupid problem

perhaps this problem is tough for those who know insertion sort !!!!

;p