정렬에 가장 적합한 방법은 무엇입니까?

Question

가능한 중복 : 정수의 배열을 정렬하는 데 사용할 수있는 가장 좋은 방법입니다
What sort algorithm provides the best worst-case performance?

빠른 정렬이 효율적인가요? 정렬에 사용되는 일반적인 방법 중 일부는 [스팸 링크 제거]에 나와 있습니다.

Answer 1

다른 정렬 방법이 다른 기능과 함께 제공됩니다.

Bubble Sort [It's simple but not good for large data][1] 

Selection Sort [Selection sort is noted for its simplicity, and also has performance advantages over more complicated algorithms in certain situations, particularly where auxiliary memory is limited.][2] 

Insertion Sort [It is much less efficient on large lists than more advanced algorithms such as quicksort, heapsort, or merge sort.][3] 

Quick Sort [Quicksort is often faster in practice than other O(nlogn) algorithms][4] 

Merge Sort [Merge sort is an O(n log n) comparison-based sorting algorithm][5] 

Heap Sort [it has the advantage of a more favorable worst-case O(n log n) runtime. Heapsort is an in-place algorithm, but is not a stable sort.][6]