各种排序算法的比较(国外英语资料).doc

各种排序算法的比较(国外英语资料) Comparison of various sorting algorithms 1. stability comparison Insert sort, bubble sort, two fork tree sort, two way merge sort and other linear sort is stable Selection, sorting, Hill sorting, quick sorting, and heap sorting are unstable 2. time complexity comparison The time complexity of inserting, sorting, bubbling, sorting, and sorting is O (N2) The time complexity of other non-linear sorting is O (nlog2n) The time complexity of linear sorting is O (n); 3. comparison of auxiliary space The auxiliary space for linear sorting and two - way merging sorting is O (n), and the auxiliary space of other sorting is O (1); 4. other comparisons The insertion and bubble sorting is slower, but the sorting is faster when the ordered sequence is locally or globally ordered. Instead, in this case, quick sorting is slower. When the n is smaller, the stability is not required. It should be sorted by choice, and the stability is required. It should be sorted by inserting or bubbling. If the keyword of the record to be ordered is within a clearly limited range, the space allowed is sorted by buckets. When n is larger, the key element is random, and the stability is not required, so it is better to use the quick sort. When n is large, keyword elements may appear themselves to be ordered and have stability requirements when the space allows. Merge sort. When n is large, the keyword elements may appear themselves to be ordered, and there is no requirement for stability, and heap sort should be used. ============================================================================= Related knowledge (all definitions are intended only to help readers understand relevant concepts, not strictly defined): 1, stable sorting and unstable sorting Simply put, all equal numbers can still keep their relative order before they are sorted by some sort of sorting method This sort of sorting method is stable. On the other hand, it is unstable. For example: a set of numbers sorted be