Preface
xvii
•
The partitioning method used for quicksort (Section 7.1) and the expected
lineartime orderstatistic algorithm (Section 9.2) is different. We now use the
method developed by Lomuto, which, along with indicator random variables,
allows for a somewhat simpler analysis. The method from the first edition, due
to Hoare, appears as a problem in Chapter 7.
•
We have modified the discussion of universal hashing in Section 11.3.3 so that
it integrates into the presentation of perfect hashing.
•
There is a much simpler analysis of the height of a randomly built binary search
tree in Section 12.4.
•
The discussions on the elements of dynamic programming (Section 15.3) and
the elements of greedy algorithms (Section 16.2) are significantly expanded.
The exploration of the activityselection problem, which starts off the greedy
algorithms chapter, helps to clarify the relationship between dynamic program
ming and greedy algorithms.
This is the end of the preview.
Sign up
to
access the rest of the document.
 Fall '09
 Algorithms, Sort, Greedy algorithm, Computational complexity theory, web site, Correctness, Hoare logic

Click to edit the document details