哪种最佳排序方法? [英] Which is the best Method used for Sorting?

问题描述

可能重复:
哪种排序算法可提供最佳的最坏情况性能?

Possible Duplicate:
What sort algorithm provides the best worst-case performance?

哪种方法可以用于对Integer数组进行排序?快速排序有效吗? 在[删除垃圾邮件链接]

Which is the best method that can be used to sort an Integer array?Is Quick Sort efficient? Some of the common methods used for sorting are mentioned in [spam link removed]

推荐答案

它们是不同的排序方法，具有不同的功能.

They are different sorting methods are available with different features.

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]

这篇关于哪种最佳排序方法?的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！