coder_life
Sorting Trilogy 3. Special sorting algorithm
Sorting not based on comparison Insertion sort, merge sort, quick sort, heap sort, etc., are all sorting algorithms based on comparison . This means that in the same process, no matter what types of comparison are int, float, double, Student, Animal, etc., as long as the ratio between the two instances is specified, then the sorting process can be reused. Data that is not based on comparison will be restricted by data conditions! Common sorts that are not based on comparison are: counting sortin