SortFight (Insertion vs Shell vs Quick)

[Savage]

Script Name: SortFight
Script Description: It will show you how fast each algorithm works.
Original Author(s): Savage
Compilation: Passed
Core Version: 2.8.0 (SC3)
InsertionSort: http://forums.soldat.pl/index.php?topic=43945.msg523901#msg523901
ShellSort: http://forums.soldat.pl/index.php?topic=38524.msg472011#msg472011
QuickSort: http://forums.soldat.pl/index.php?topic=28614.msg410794#msg410794

Constants:
arrayl - Amount of numbers to sort
randommin - Minimum number size for random order list
randommax - Maximum number size for random order list
nearlymin - Minimum dispersion range for nearly sorted order list
nearlymax - Maximum dispersion range for nearly sorted order list

Commands:
!sortedasc - Creates sorted list and backup in ascending order
!sorteddes - Creates sorted list and backup in descending order
!nsortedasc - Creates nearly sorted list and backup in ascending order
!nsorteddes - Creates nearly sorted list and backup in descending order
!genrandom - Creates list and backup in random order
!backup - Loads last created backup
!inssortasc - Sorts list in ascending order by InsertionSort
!inssortdes - Sorts list in descending order by InsertionSort
!shellsortasc - Sorts list in ascending order by ShellSort
!shellsortdes - Sorts list in descending order by ShellSort
!quicksortasc - Sorts list in ascending order by QuickSort
!quicksortdes - Sorts list in descending order by QuickSort

Given result is current time(seconds:milliseconds) on server between beginning and end of sorting

InsertionSort - 32 numbers
* Random: 4ms
* Nearly sorted: 0ms
* Reversed: 8ms
ShellSort - 32 numbers
* Random: 4ms
* Nearly sorted: 2ms
* Reversed: 5ms
QuickSort - 32 numbers
* Random: 1ms
* Nearly sorted: 1ms
* Reversed: 0ms
InsertionSort - 256 numbers
* Random: 98ms
* Nearly sorted: 8ms
* Reversed: 152ms
ShellSort - 256 numbers
* Random: 58ms
* Nearly sorted: 35ms
* Reversed: 41ms
QuickSort - 256 numbers
* Random: 12ms
* Nearly sorted: 10ms
* Reversed: 6ms