"Introduction to Algorithms" Reading notes--the 1th and 2 chapters after class

Chapter I.

Study Questions

1-1 (comparison of elapsed time) determines the maximum size of the problem solved within the time t.

Above is the answer provided online.

Note the point:

1, the leftmost column is about the growth of n description, it is worth remembering the order of these growth, it is very useful, ah, it will be easy to learn a few points;

2, note that the 1s internal energy processing in order to increase the scale of N is 10 of 6 of the parties, remember that this result can be pushed to export the scale of other growth levels of processing;

3. Note that LG here refers to a logarithmic function with a base of 2.

By the way, make a LGN growth chart and feel it:

Originally want to put N and nlgn painting together, but the effect is not satisfied, such as:

I can see that NLGN is growing much faster than n! /False

Chapter II

"Introduction to Algorithms" Reading notes--the 1th and 2 chapters after class