Algorithms in Java, Parts 1-4

Front Cover
Addison-Wesley Professional, Jul 23, 2002 - Computers - 768 pages

This edition of Robert Sedgewick's popular work provides current and comprehensive coverage of important algorithms for Java programmers. Michael Schidlowsky and Sedgewick have developed new Java implementations that both express the methods in a concise and direct manner and provide programmers with the practical means to test them on real applications.

Many new algorithms are presented, and the explanations of each algorithm are much more detailed than in previous editions. A new text design and detailed, innovative figures, with accompanying commentary, greatly enhance the presentation. The third edition retains the successful blend of theory and practice that has made Sedgewick's work an invaluable resource for more than 400,000 programmers!

This particular book, Parts 1-4, represents the essential first half of Sedgewick's complete work. It provides extensive coverage of fundamental data structures and algorithms for sorting, searching, and related applications. Although the substance of the book applies to programming in any language, the implementations by Schidlowsky and Sedgewick also exploit the natural match between Java classes and abstract data type (ADT) implementations.

Highlights

  • Java class implementations of more than 100 important practical algorithms
  • Emphasis on ADTs, modular programming, and object-oriented programming
  • Extensive coverage of arrays, linked lists, trees, and other fundamental data structures
  • Thorough treatment of algorithms for sorting, selection, priority queue ADT implementations, and symbol table ADT implementations (search algorithms)
  • Complete implementations for binomial queues, multiway radix sorting, randomized BSTs, splay trees, skip lists, multiway tries, B trees, extendible hashing, and many other advanced methods
  • Quantitative information about the algorithms that gives you a basis for comparing them
  • More than 1,000 exercises and more than 250 detailed figures to help you learn properties of the algorithms

Whether you are learning the algorithms for the first time or wish to have up-to-date reference material that incorporates new programming styles with classic and new algorithms, you will find a wealth of useful information in this book.

 

Selected pages

Contents

Introduction
Data Structures
Quicksort
Merging and Mergesort
Sorting
Searching
Balanced Trees
Hashing
Radix Search
External Searching
Elementary Sorting Methods
Appendix
Index

Other editions - View all

Algorithms in Java, Volume 1, Parts 1-4
Robert Sedgewick
No preview available - 2003
Algorithms in Java, Parts 1-4
Robert Sedgewick
No preview available - 2002

Common terms and phrases

abstract analysis applications array average basic binary search binary tree binomial queue bits bottom bottom-up bytes Chapter client program consider corresponding cost data structure data type define develop digit divide-and-conquer double hashing duplicate keys efficient example Exercise external Figure hash function heap heapsort initially empty tree inner loop input insertion sort integers internal nodes Java linear probing linked lists maximum merge mergesort move MSD radix sort nonrecursive null link number of comparisons objects operations parameter partitioning element patricia trie performance position priority queue priority-queue problem Property quicksort radix sort random keys recursive recursive calls recursive program red-black tree reference remove representation result root running search key search miss search tree Section selection sort sequence shellsort skip list solve sorting methods sorting network string subfiles subtree symbol table symbol-table implementation trie values

About the author (2002)

Robert Sedgewick is the William O. Baker Professor of Computer Science at Princeton University. He is a Director of Adobe Systems and has served on the research staffs at Xerox PARC, IDA, and INRIA. He earned his Ph.D from Stanford University under Donald E. Knuth.

Bibliographic information

TitleAlgorithms in Java, Parts 1-4
AuthorRobert Sedgewick
Edition3
PublisherAddison-Wesley Professional, 2002
ISBN0321623975, 9780321623973
Length768 pages
Subjects ›  › 

Computers / Programming / Algorithms
Computers / Software Development & Engineering / Systems Analysis & Design
  
Export CitationBiBTeX EndNote RefMan