Cheating paper for Data Structure
Time Complexity (Lecture 2)1.1. Definition: given input size N, find running time of the algorithm.1.2. Notation:1.2.1. |X|: the size of X1.2.2. o(N) little-o notation: limit of function at given valuee.g.1.2.3. O(N) big-o notation: worst case1.2..
原创
2020-08-21 17:58:59 ·
1109 阅读 ·
0 评论