![]() ![]() ![]() NEW - NEW! Pseudocode updated from Pascal-like to Java-like includes an appendix with Java examples.NEW - NEW! Review of abstract data types, with Java class definitions for several commonly used ADTs such as list, tree, stack, and priority queue. ![]() NEW - NEW! Expanded mathematical background emphasizes practical techniques, including solutions to recurrence equations.NEW - NEW! Expanded treatment of recursion with a clear, student-friendly review of how it works, and why it is a valuable programming technique.Material on accelerated version of Heapsort, section on computing with DNA, chapter on Dynamic Sets. It continues the tradition of solid mathematical analysis and clear writing style that made it so popular in previous editions. The new Third Edition features the addition of new topics and exercises and an increased emphasis on algorithm design techniques such as divide-and-conquer and greedy algorithms. › Description Drawing upon combined decades of teaching experience, Professors Sara Baase and Allen Van Gelder have extensively revised this best seller to make it the most current and accessible choice for any algorithms course. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |