Lecture04 - Why don't CS profs ever stop talking about...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
1 Why don't CS profs ever stop talking about sorting?! • Computers spend more time sorting than anything else, historically 25% on mainframes. • Sorting is the best studied problem in computer science, with a variety of different algorithms known. • Most of the interesting ideas we encounter in the course are taught in the context of sorting, such as divide-and- conquer, randomized algorithms, and lower bounds. You should have seen most of the algorithms - we will concentrate on the analysis Applications of Sorting • Searching what else??? Convex Hulls
Background image of page 1

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

View Full DocumentRight Arrow Icon
2 Huffman Codes If you are trying to minimize the amount of space a text file is taking up, it is silly to assign each letter the same length (i.e. one byte) code. Example : e is more common than q , a is more common than z . If we were storing English text, we would want a and e to have shorter codes than q and z . Sorting • Comparison-based algorithm review – You should know most of the algorithms – We will concentrate on their analyses – Special emphasis: Heapsort Heaps and Heapsort • Definition • Operations and uses in heap construction – Insertion – Heapify – Extract max • Heapsort
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 07/25/2008 for the course CSE 830 taught by Professor Ofria during the Spring '08 term at Michigan State University.

Page1 / 7

Lecture04 - Why don't CS profs ever stop talking about...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online