Of Review of data structure - algorithm complexity analysis

Algorithm complexity analysis

True or False

1. The two main aspects of the analysis of algorithms and time complexity analysis of the complexity of the space. T

2. \ (N ^ 2logN \) and \ (NlogN ^ 2 \) have the same growth rate. F
   analysis: the former is twice the cubic order, which is the second order of the square.

3. \ (2 ^ N \) and \ (N ^ N \) have the same growth rate. F
   analysis: exponential order factorial less than the growth rate is less than \ (N ^ N \)

4. \ ((NlogN) / 1000 \ ) is \ (O (N) \) a. F

5. In any case, the time complexity is \ (O (n ^ 2) \) of the time complexity of the algorithm than \ (O (n * logn) \) time algorithm takes is longer. F

6. For some algorithms, with the expansion of the scale of the problem, the time spent is not necessarily monotonically increasing. T

Multiple choice

Function Problems

Detailed knowledge points