Advanced Algorithm Diary 4:2nd lesson Notes

Lecture: Shen Xiaojun
Record: Sun Xiang
time:2017/06/07 1. Sorting

N−1+⌈lgn⌉n-1+\lceil LGN \rceil
To sort
Base sort
Counting sort
Tournament sorting

The decision tree finds no duplicate numbers.
It is not possible to have linear time to get the highest number of frequencies, otherwise, linear time can be found in a set of the highest frequency of the number of numbers, if not 1, then it indicates that the series of numbers are duplicated. However, we have previously proved that this process cannot exceed NLGN