Lecture_complexity_2p - Lecture 20 Computational Complexity...

Info icon This preview shows pages 1–7. Sign up to view the full content.

4/13/2008 1 Evaluating Algorithms Time as a function of Size Big-O Notation Lecture 20: Computational Complexity Big O Notation Big-O and Plotting the Time Time Complexity of Sorting Algorithms Evaluating Algorithms What makes an algorithm "good" or "bad"? Obviously, an algorithm has to produce correct Obviously, an algorithm has to produce correct output to be "good". But what else? Another way of asking this question: If we have two algorithms, and they both do the same job, which one should we use? Example: Bubble Sort and Quick Sort both produce the same result. How should you decide which one to use?
Image of page 1

Info icon This preview has intentionally blurred sections. Sign up to view the full version.