Compare sorting algorithms' performance: Difference between revisions

Content added Content deleted

Inline

@@ Line 143: / Line 143: @@
 ====ones====
 [http://bahus.3ka.mipt.ru/gallery/data/public/24.12.07/energy_104231.png ones.png] (143KiB)
-builtinsort     - O(N)
-insertion_sort  - O(N)
+ builtinsort     - O(N)
-qsort           - O(N**2)
+ insertion_sort  - O(N)
-qsortranpart    - O(N)
+ qsort           - O(N**2)
+ qsortranpart    - O(N)
 ====range====
 [http://bahus.3ka.mipt.ru/gallery/data/public/24.12.07/energy_105040.png range.png] (145KiB)
-builtinsort     - O(N)
+ builtinsort     - O(N)
-insertion_sort  - O(N)
+ insertion_sort  - O(N)
-qsort           - O(N**2)
+ qsort           - O(N**2)
-qsortranpart    - O(N*log(N))
+ qsortranpart    - O(N*log(N))
 ====shuffled range====
 [http://bahus.3ka.mipt.ru/gallery/data/public/24.12.07/energy_105620.png shuffledrange.png] (152KiB)
-builtinsort     - O(N)  ???
+ builtinsort     - O(N)  ???
-insertion_sort  - O(N**4) ???
+ insertion_sort  - O(N**4) ???
-qsort           - O(N*log(N))
+ qsort           - O(N*log(N))
-qsortranpart    - O(N) ???
+ qsortranpart    - O(N) ???