Swap Sort (keteki)

Given a string containing lowercase English alphabets. The alphabets needs to be sorted in ascending order. The only movement allowed is taking a character in the string and moving it to the right till it reaches correct position in the string, making the string ascending. Print the minimum number of moves needed to sort the string. Example of movement is: baaab if becomes aaabb then it has 3 mov