Sorting---internal sorting algorithms (quick, hill, merge, base, bubble, select sort) Compare

1. Summary of the complexity of internal sorting

1) Complexity of time

The average time complexity of 4 sorts is O (nlog2n), "Get back Faster with nlog2n" (Fast, hill Sort, merge, heap sort)

In the worst case, the time complexity of the n*n is O (

2) Complexity of space

O (log2n) Quick-line

O (n) Merge

O (RD) Cardinality

All the others are O (1)

3) Stability

Unstable: "Review the pain Ah, emotional instability, quickly choose a bunch of friends to chat" (Quick row, hill, simple selection sorting, heap sorting)

The rest are stable.

4) A sequencing to ensure that a keyword reaches its final location

Exchange Class (blistering, fast)

Select Class (Simple selection, heap)

Sorting---internal sorting algorithms (quick, hill, merge, base, bubble, select sort) Compare