This preview shows pages 1–7. Sign up to view the full content.
4/13/20081•Evaluating Algorithms•Time as a function of Size•Big-O NotationLecture 20: Computational ComplexityBig O Notation•Big-O and Plotting the Time•Time Complexity of Sorting AlgorithmsEvaluating AlgorithmsWhat makes an algorithm "good" or "bad"?Obviously, an algorithm has to produce correctObviously, 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?
This preview
has intentionally blurred sections.
Sign up to view the full version.