tailieunhanh - Lecture Data Structures and Algorithms - Chapter 2: Complexity of Algorithms

Lecture Data Structures and Algorithms - Chapter 2: Complexity of Algorithms. After studying this section you should be able to: define concept computational complexity and its sepcial cases, best, average, and worst; analyze algorithms and use Big-O notation tocharacterize the computational complexity of algorithmscomposed by using the following control structures:sequence, branching, and iteration (not recursion), . |