Data Structures Ch 培训讲义.pptVIP

* Data Structures and Algorithm Analysis in C CS222 Chapter 2: Algorithm Analysis Data Structures and Algorithm Analysis in C Learning how to evaluate algorithms What is Big O notation Running time calculations Example algorithms Checking Analysis Objective Review Logarithms in the Running Time An algorithm runs in O(log N) if it takes constant (O(1)) time to cut the problem by a fraction (which is usually ?). However, if the work can only be reduced by a constant amount, it remains O(N). Examples of O(log N) behavior: A) Binary search B) Euclids Algorithm C) Exponentiation