This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
if we go right to left i think we can get the best solution so we start with this | |
2 3 4 5 6 7 8 9 1 | |
check the position of the end against its value, doesn't work so we check pos -1 and pos -2 and if we find we do a swap | |
and increment count if not we say too chaotic | |
2 3 4 5 6 7 8 1 9 > count = 1 | |
2 3 4 5 6 7 1 8 9 > count = 2 | |
2 3 4 5 6 1 7 8 9 > count = 3 | |
etc |