Advanced Algorithm Diary 4:2nd lesson Notes

Source: Internet
Author: User

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

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.