Preface xvii • The partitioning method used for quicksort (Section 7.1) and the expected linear-time order-statistic 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 ﬁrst edition, due to Hoare, appears as a problem in Chapter 7. • We have modiﬁed 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 signiﬁcantly 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. • We have replaced the proof of the running time of the disjoint-set-union data
This is the end of the preview. Sign up
access the rest of the document.