Drawing upon combined decades of teaching experience, Sara Baase and Allen Van Gelder have extensively revised this best seller to make it the most current and accessible choice for anyone interested in gaining a solid understanding of computer algorithm analysis and design. This edition features the addition of new topics such as computing with DNA, the accelerated version of heapsort, and dynamic sets, as well as an increased emphasis on algorithm design techniques such as divide-and-conquer and greedy algorithms. It continues the tradition of solid mathematical analysis and clear writing style that made it so popular in previous editions. This edition features implementations in a Java-like pseudocode, and includes an appendix with Java examples.