Algorithms in Java, Parts 1-4

by Sedgewick, Robert

• ISBN13: 9780201361209
• ISBN10: 0201361205
• Edition: 3rd
• Format: Paperback
• Copyright: 2002-07-23
• Publisher: Addison-Wesley Professional

Summary

Sedgewick has a real gift for explaining concepts in a way that makes them easy to understand. The use of real programs in page-size (or less) chunks that can be easily understood is a real plus. The figures, programs, and tables are a significant contribution to the learning experience of the reader; they make this book distinctive. --William A. Ward, University of South Alabama 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. bull;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. 0201361205B08282002

Author Biography

Robert Sedgewick is the William O. Baker Professor of Computer Science at Princeton University

Table of Contents

Fundamentals
Introduction	p. 3
Algorithms	p. 4
A Sample Problem: Connectivity	p. 7
Union-Find Algorithms	p. 11
Perspective	p. 22
Summary of Topics	p. 24
Principles of Algorithm Analysis	p. 27
Implementation and Empirical Analysis	p. 28
Analysis of Algorithms	p. 33
Growth of Functions	p. 36
Big-Oh Notation	p. 44
Basic Recurrences	p. 49
Examples of Algorithm Analysis	p. 53
Guarantees, Predictions, and Limitations	p. 60
Data Structures
Elementary Data Structures	p. 69
Building Blocks	p. 70
Arrays	p. 84
Linked Lists	p. 91
Elementary List Processing	p. 97
Memory Allocation for Lists	p. 107
Strings	p. 111
Compound Data Structures	p. 116
Abstract Data Types	p. 127
Collections of Items	p. 137
Pushdown Stack ADT	p. 139
Examples of Stack ADT Clients	p. 142
Stack ADT Implementations	p. 148
Generic Implementations	p. 154
Creation of a New ADT	p. 157
FIFO Queues and Generalized Queues	p. 165
Duplicate and Index Items	p. 173
First-Class ADTs	p. 177
Application-Based ADT Example	p. 188
Perspective	p. 194
Recursion and Trees	p. 197
Recursive Algorithms	p. 198
Divide and Conquer	p. 206
Dynamic Programming	p. 219
Trees	p. 227
Mathematical Properties of Trees	p. 236
Tree Traversal	p. 240
Recursive Binary-Tree Algorithms	p. 246
Graph Traversal	p. 251
Perspective	p. 257
Sorting
Elementary Sorting Methods	p. 263
Rules of the Game	p. 265
Generic Sort Implementations	p. 270
Selection Sort	p. 283
Insertion Sort	p. 285
Bubble Sort	p. 288
Performance Characteristics of Elementary Sorts	p. 289
Algorithm Visualization	p. 295
Shellsort	p. 300
Sorting Linked Lists	p. 308
Key-Indexed Counting	p. 312
Quicksort	p. 315
The Basic Algorithm	p. 316
Performance Characteristics of Quicksort	p. 321
Stack Size	p. 325
Small Subfiles	p. 328
Median-of-Three Partitioning	p. 331
Duplicate Keys	p. 336
Strings and Vectors	p. 339
Selection	p. 341
Merging and Mergesort	p. 347
Two-Way Merging	p. 348
Abstract In-Place Merge	p. 351
Top-Down Mergesort	p. 353
Improvements to the Basic Algorithm	p. 357
Bottom-Up Mergesort	p. 359
Performance Characteristics of Mergesort	p. 363
Linked-List Implementations of Mergesort	p. 366
Recursion Revisited	p. 370
Priority Queues and Heapsort	p. 373
Elementary Implementations	p. 377
Heap Data Structure	p. 381
Algorithms on Heaps	p. 383
Heapsort	p. 389
Priority-Queue ADT	p. 396
Priority Queues for Client Arrays	p. 402
Binomial Queues	p. 406
Radix Sorting	p. 417
Bits, Bytes, and Words	p. 419
Binary Quicksort	p. 423
MSD Radix Sort	p. 427
Three-Way Radix Quicksort	p. 435
LSD Radix Sort	p. 441
Performance Characteristics of Radix Sorts	p. 444
Sublinear-Time Sorts	p. 448
Special-Purpose Sorting Methods	p. 453
Batcher's Odd-Even Mergesort	p. 455
Sorting Networks	p. 460
Sorting In Place	p. 468
External Sorting	p. 474
Sort-Merge Implementations	p. 480
Parallel Sort-Merge	p. 486
Searching
Symbol Tables and BSTs	p. 495
Symbol-Table Abstract Data Type	p. 497
Key-Indexed Search	p. 507
Sequential Search	p. 511
Binary Search	p. 519
Index Implementations with Symbol Tables	p. 524
Binary Search Trees	p. 531
Performance Characteristics of BSTs	p. 537
Insertion at the Root in BSTs	p. 542
BST Implementations of Other ADT Operations	p. 546
Balanced Trees	p. 555
Randomized BSTs	p. 559
Splay BSTs	p. 566
Top-Down 2-3-4 Trees	p. 572
Red-Black Trees	p. 577
Skip Lists	p. 587
Performance Characteristics	p. 595
Hashing	p. 599
Hash Functions	p. 600
Separate Chaining	p. 610
Linear Probing	p. 615
Double Hashing	p. 620
Dynamic Hash Tables	p. 625
Perspective	p. 629
Radix Search	p. 635
Digital Search Trees	p. 637
Tries	p. 641
Patricia Tries	p. 650
Multiway Tries and TSTs	p. 660
Text-String-Index Applications	p. 679
External Searching	p. 685
Rules of the Game	p. 687
Indexed Sequential Access	p. 690
B Trees	p. 692
Extendible Hashing	p. 706
Perspective	p. 718
Appendix	p. 723
Index	p. 727
Table of Contents provided by Ingram. All Rights Reserved.

Excerpts

This book is the first of three volumes that are intended to survey the most important computer algorithms in use today. This first volume (Parts 1-4) covers fundamental concepts (Part 1), data structures (Part 2), sorting algorithms (Part 3), and searching algorithms (Part 4); the second volume (Part 5) covers graphs and graph algorithms; and the (yet to be published) third volume (Parts 6-8) covers strings (Part 6), computational geometry (Part 7), and advanced algorithms and applications (Part 8). The books are useful as texts early in the computer science curriculum, after students have acquired basic programming skills and familiarity with computer systems, but before they have taken specialized courses in advanced areas of computer science or computer applications. The books also are useful for self-study or as a reference for people engaged in the development of computer systems or applications programs because they contain implementations of useful algorithms and detailed information on these algorithms' performance characteristics. The broad perspective taken makes the series an appropriate introduction to the field. Together the three volumes comprise theThird Editionof a book that has been widely used by students and programmers around the world for many years. I have completely rewritten the text for this edition, and I have added thousands of new exercises, hundreds of new figures, dozens of new programs, and detailed commentary on all the figures and programs. This new material provides both coverage of new topics and fuller explanations of many of the classic algorithms. A new emphasis on abstract data types throughout the books makes the programs more broadly useful and relevant in modern object-oriented programming environments. People who have read previous editions will find a wealth of new information throughout; all readers will find a wealth of pedagogical material that provides effective access to essential concepts. These books are not just for programmers and computer science students. Everyone who uses a computer wants it to run faster or to solve larger problems. The algorithms that we consider represent a body of knowledge developed during the last 50 years that is the basis for the efficient use of the computer for a broad variety of applications. From N-body simulation problems in physics to genetic-sequencing problems in molecular biology, the basic methods described here have become essential in scientific research; and from database systems to Internet search engines, they have become essential parts of modern software systems. As the scope of computer applications becomes more widespread, so grows the impact of basic algorithms. The goal of this book is to serve as a resource so that students and professionals can know and make intelligent use of these fundamental algorithms as the need arises in whatever computer application they might undertake. Scope This book,Algorithms in Java, Third Edition, Parts 1-4, contains 16 chapters grouped into four major parts: fundamentals, data structures, sorting, and searching. The descriptions here are intended to give readers an understanding of the basic properties of as broad a range of fundamental algorithms as possible. The algorithms described here have found widespread use for years, and represent an essential body of knowledge for both the practicing programmer and the computerscience student. The second volume is devoted to graph algorithms, and the third consists of four additional parts that cover strings, geometry, and advanced topics. My primary goal in developing these books has been to bring together fundamental methods from these areas, to provide access to the best methods known for solving problems by computer. You will most appreciate the material here if you have had one or two previous courses in co