vi
Contents
II
Sorting and Order Statistics
Introduction
123
6
Heapsort
127
6.1
Heaps
127
6.2
Maintaining the heap property
130
6.3
Building a heap
132
6.4
The heapsort algorithm
135
6.5
Priority queues
138
7
Quicksort
145
7.1
Description of quicksort
145
7.2
Performance of quicksort
149
7.3
A randomized version of quicksort
153
7.4
Analysis of quicksort
155
8
Sorting in Linear Time
165
8.1
Lower bounds for sorting
165
8.2
Counting sort
168
8.3
Radix sort
170
8.4
Bucket sort
174
9
Medians and Order Statistics
183
9.1
Minimum and maximum
184
9.2
This is the end of the preview.
Sign up
to
access the rest of the document.
 Fall '09
 Algorithms, Sort, linear time, order statistics

Click to edit the document details