Algorithms in JavaFor the first time, Sedgewick's seminal work on algorithms and data structures is available with implementations in Java. Michael Schidlowsky and Sedgewick have developed new Java code that both expresses the methods in a concise and direct manner, and also provides programmers with the practical means to test them on real applications. This particular book, Parts 1-4, represents the essential first half of Sedgewick's complete work. Its four parts are fundamentals, data structures, sorting, and searching. It has expanded coverage of arrays, linked lists, strings, trees, ADT's, and object-oriented programming. |
Other editions - View all
Algorithms in Java: Fundamentals data structures ..., Volume 1, Parts 1-4 Robert Sedgewick No preview available - 2002 |
Common terms and phrases
abstract ADT interface analysis applications array basic binary search binary tree binomial queue boolean bubble sort bytes Chapter client programs connected consider corresponding cost data structures data type define depth-first search develop divide-and-conquer double efficient example Exercise external nodes FIFO FIFO queue Figure gram graph heap heapsort implementation increment inner loop input insertion sort integers Java linked lists linked-list mathematical maximum merge mergesort move nonrecursive null number of comparisons objects operations pairs parameter partitioning element path performance priority queue priority-queue problem Property pushdown stack quick-union quicksort radix sort recursive calls recursive program red-black tree reference remove representation result root running Section selection sort sequence shellsort skip list solve sorting algorithms sorting methods sorting network specific static void string subfiles subtree symbol table symbol-table tion top-down traversal values Write x.next