# Analysis of the top ten sorting algorithms

Posted Jun 27, 2020 • 1 min read

## Analysis of the top ten sorting algorithms

**Blog description**

The information involved in the article comes from the Internet collation and personal summary, which means personal learning and experience summary. If there is any infringement, please contact me to delete, thank you!

#### Ten algorithm comparison charts

(From Shang Silicon Valley)

#### Explanation of related terms

##### Stable

If a was originally in front of b and a=b, after sorting, a is still in front of b;

##### unstable

If a was originally in front of b, and a=b, after sorting, a might appear after b;

##### Sort within

All sorting operations are completed in memory;

##### Outer sort

Because the data is too large, the data is placed on the disk, and the data transmission through the disk and memory can be sorted;

##### time complexity

The time it takes to execute an algorithm.

##### Space complexity

The amount of memory required to run a program.

##### n

Data scale

##### k

The number of "barrels"

##### In-place

No additional memory

##### Out-place

Take up extra memory

**thank**

Shang Silicon Valley

Universal Network

And hardworking self