SPOJ Inversion Sort is a problem mentioned in list of practice problems for bfs here. I tried using bfs by starting from current string and moving to all possible inversions from that till desired string, but I am getting TLE. I couldnot find any editorial for this problem. Any ideas on how to solve this? Thankyou.