Lecture 21

# Introduction to Algorithms, Second Edition

• Notes
• davidvictor
• 4

This preview shows pages 1–2. Sign up to view the full content.

The University of Texas at Austin Comparison & Integer Sorting Department of Computer Sciences Professor Vijaya Ramachandran Lecture 21 CS357: ALGORITHMS, Spring 2006 Lower bound on comparison-based sorting There are several algorithms that sort n elements in O ( n log n ) time using only comparisons between pairs of input elements in order to obtain their relative ordering. These include MergeSort and Heapsort and also Quicksort (expected time when randomized). An algorithm that sorts n elements by only making comparisons between pairs of input elements in order to deduce their relative order will be called a comparison-based algorithm . We will now show that any comparison-based algorithm for sorting must make Ω( n log n ) comparisons and hence must have Ω( n log n ) running time. Let A be such an algorithm. As described in the textbook, we will capture the comparisons it makes on every input of length n in terms of a binary decision tree . Thus the decision tree represents all comparisons made by the algorithm on every input of length n , but ignores data movement and other aspects of the algorithm. The leaves of this decision tree represent all possible outputs for an input of length n

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

This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### What students are saying

• As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

Kiran Temple University Fox School of Business ‘17, Course Hero Intern

• I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

Dana University of Pennsylvania ‘17, Course Hero Intern

• The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

Jill Tulane University ‘16, Course Hero Intern