18_split_Introduction to Algorithms 2nd Edition

18_split_Introduction to Algorithms 2nd Edition - Preface...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
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 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 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
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

This document was uploaded on 11/22/2010.

Ask a homework question - tutors are online