Prefacexvii•The partitioning method used for quicksort (Section 7.1) and the expectedlinear-time order-statistic algorithm (Section 9.2) is different. We now use themethod developed by Lomuto, which, along with indicator random variables,allows for a somewhat simpler analysis. The method from the first edition, dueto Hoare, appears as a problem in Chapter 7.•We have modified the discussion of universal hashing in Section 11.3.3 so thatit integrates into the presentation of perfect hashing.•There is a much simpler analysis of the height of a randomly built binary searchtree in Section 12.4.•The discussions on the elements of dynamic programming (Section 15.3) andthe elements of greedy algorithms (Section 16.2) are significantly expanded.The exploration of the activity-selection 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.
access the rest of the document.