Sorting Algorithm:
describe:
It is an algorithm that can sort a string of data in a specific order.
Understanding of stability:
Assuming that in the record sequence to be sorted, there are multiple records with the same keyword, if sorted, the relative order of these records remains unchanged
, that is: in the original sequence, a=b, and a is before b , and after sorting, if a is still before b, the sorting algorithm is called stable, otherwise it is unstable.
Unstable algorithm:
Heap Sort, Quick Sort, Hill Sort, Direct Selection Sort
Stable Algorithm:
Radix sort, bubble sort, direct insertion sort, such insertion sort, merge sort