331

Mapping the Swaps
Type: Sorting & Searching  
Diff: 6.0

Tricks

A brute force method are required for this problem. You have to check all the possible swap. Count those which are capable of  sorting  the array. Normally it is very hard problem but if you think it recursively, it become easy.

Related Problems & Topics

299 Train Swapping  Contact10327 Flip Sort 

If you have any advice, complements 

or proposal, please  Send mail to Author

Submit

 

1