Which sorting algorithm provides the best performance in the worst case?

Question

What is the fastest sorting algorithm for the absolute worst case? I don't care about the best case and accept a gigantic dataset, if that even matters.

Answer 1

make sure you see this:

visualization of sorting algorithms - this helped me decide which type of alg to use.

Answer 2

. , ( , ) radix, O (n). O (n log n).

Answer 3

, O (N log N) . - , MergeSort HeapSort, O (N log N) .

HeapSort , , MergeSort ( ).

, Wikipedia, O (n log n) . ( mmyers)

Answer 4

, : ( ) , O (n log n) !

( ) O (n log n)

O (n log n) ( )

• Smooth Sort
• Intro Sort

n log n

, n log n, ,

Radix Bucket , . , .

Answer 5

Quicksort, , , , Heapsort Mergesort. O(n log n) .

Answer 6

(.. , ), , , //- - , .

; , /.

Answer 7

, ( ).

/. " ", , .

Answer 8

, Big O O (n).

BEST AND WORST CASE . - 2- MergeSort

Answer 9

, , , , merge-sort, . , , VASTLY , .

, " ".

Answer 10

, . , , Quicksort, , , , . , " " " " ( Quick Merge, ).

Answer 11

, quicksort.

O (nlog n) , O (n ^ 2) , .

, .

Answer 12

. Vs Merge Sort Quicksort Mergesort, .

Answer 13

, . . O (n) , O (n ^ 2), , .

Answer 14

, ( , , ), quicksort .

Answer 15

, O (n log n). .

O (n log n), (, bead sort, ).

Answer 16

: radix , , , . , .

http://en.wikipedia.org/wiki/Radix_sort

PS This is the O (k * n) algorithm, where k is the key size.

Answer 17

It depends on the characteristics of the data.