Repository navigation
Отчет по сортировке Шелла
Running time of the first algorithm(border = 10, size = 10000) = 0.002
The array has been sorted
Running time of the second algorithm(border = 10, size = 10000) = 0.003
The array has been sorted
Running time of the third algorithm(border = 10, size = 10000) = 0.009
The array has been sorted
Running time of the first algorithm(border = 10, size = 100000) = 0.146
The array has been sorted
Running time of the second algorithm(border = 10, size = 100000) = 0.044
The array has been sorted
Running time of the third algorithm(border = 10, size = 100000) = 0.107
The array has been sorted
Running time of the first algorithm(border = 10, size = 1000000) = 0.286
The array has been sorted
Running time of the second algorithm(border = 10, size = 1000000) = 0.265
The array has been sorted
Running time of the third algorithm(border = 10, size = 1000000) = 2.457
The array has been sorted
Running time of the first algorithm(border = 1000, size = 10000) = 0.004
The array has been sorted
Running time of the second algorithm(border = 1000, size = 10000) = 0.003
The array has been sorted
Running time of the third algorithm(border = 1000, size = 10000) = 0.008
The array has been sorted
Running time of the first algorithm(border = 1000, size = 100000) = 0.035
The array has been sorted
Running time of the second algorithm(border = 1000, size = 100000) = 0.038
The array has been sorted
Running time of the third algorithm(border = 1000, size = 100000) = 0.157
The array has been sorted
Running time of the first algorithm(border = 1000, size = 1000000) = 0.587
The array has been sorted
Running time of the second algorithm(border = 1000, size = 1000000) = 0.506
The array has been sorted
Running time of the third algorithm(border = 1000, size = 1000000) = 2.736
The array has been sorted
Running time of the first algorithm(border = 100000, size = 10000) = 0.003
The array has been sorted
Running time of the second algorithm(border = 100000, size = 10000) = 0.003
The array has been sorted
Running time of the third algorithm(border = 100000, size = 10000) = 0.007
The array has been sorted
Running time of the first algorithm(border = 100000, size = 100000) = 0.037
The array has been sorted
Running time of the second algorithm(border = 100000, size = 100000) = 0.053
The array has been sorted
Running time of the third algorithm(border = 100000, size = 100000) = 0.127
The array has been sorted
Running time of the first algorithm(border = 100000, size = 1000000) = 0.657
The array has been sorted
Running time of the second algorithm(border = 100000, size = 1000000) = 0.704
The array has been sorted
Running time of the third algorithm(border = 100000, size = 1000000) = 2.947
The array has been sorted
random_mas_10000_10.txt
random_mas_10000_1000.txt
random_mas_10000_100000.txt
random_mas_100000_10.txt
random_mas_100000_1000.txt
random_mas_100000_100000.txt
random_mas_1000000_10.txt
random_mas_1000000_1000.txt
random_mas_1000000_100000.txt