Reverses

This problem came from [url=http://www.mathshell.com/materials.php?item=ppn&series=tss]http://www.mathshell.com/materials.php?item=ppn&series=tss[/url][br][br]Things to try:[list][*]Find some rules for the moves which will put any row of numbers in ascending order.[/*][*]Find some rules for the moves which will put any row of numbers in ascending order in the fewest moves possible.[/*][*]Without having any unnecessary moves, what is the most moves needed for putting the numbers in ascending order?[/*][/list]

Information: Reverses