EVERYDAY FREE SHIPPING on $25 & up  Excludes Marketplace items
EVERYDAY FREE SHIPPING
on $25 & up
 Excludes Marketplace
Algorithms in Java, Parts 1-4 : Fundamentals, Data Structures, Sorting, Searching

Algorithms in Java, Parts 1-4 : Fundamentals, Data Structures, Sorting, Searching - 3rd edition

ISBN13: 978-0201361209

Cover of Algorithms in Java, Parts 1-4 : Fundamentals, Data Structures, Sorting, Searching 3RD 03 (ISBN 978-0201361209)
ISBN13: 978-0201361209
ISBN10: 0201361205

Cover type: Paperback
Edition: 3RD 03
Copyright: 2003
Publisher: Addison-Wesley Longman, Inc.
Published: 2003
International: No

List price: $69.99

Algorithms in Java, Parts 1-4 : Fundamentals, Data Structures, Sorting, Searching - 3RD 03 edition

ISBN13: 978-0201361209

Robert Sedgewick

ISBN13: 978-0201361209
ISBN10: 0201361205

Cover type: Paperback
Edition: 3RD 03
Copyright: 2003
Publisher: Addison-Wesley Longman, Inc.
Published: 2003
International: No
Summary

The author introduces a broad variety of important and useful algorithms, discussing both their essential characteristics and individual subtleties, explaining both their underlying theory and their application in practice. His strategy is to implement and test the algorithms, to experiment with their variants, to discuss their operation on small examples, and to try them out on larger, real-world examples. In this version, the algorithms are described in Java. A world-renowned expert on algorithm analysis, the author has taken great pains to make his book current and comprehensive. With numerous illustrations, exercises, and pedagogical aids, his book also is uniquely attentive to student learning needs.


Author Bio

Sedgewick, Robert : Princeton University


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.

Table of Contents

I. FUNDAMENTALS.

1. Introduction.
Algorithms.
A Sample Problem: Connectivity.
Union-Find Algorithms.
Perspective.
Summary of Topics.

2. Principles of Algorithm Analysis.
Implementation and Empirical Analysis.
Analysis of Algorithms.
Growth of Functions.
Big-Oh notation.
Basic Recurrences.
Examples of Algorithm Analysis.
Guarantees, Predictions, and Limitations.

II. DATA STRUCTURES.

3. Elementary Data Structures.
Building Blocks.
Arrays.
Linked Lists.
Elementary List Processing.
Memory Allocation for Lists.
Strings.
Compound Data Structures.

4. Abstract Data Types.
Collections of Items.
Pushdown Stack ADT.
Examples of Stack ADT Clients.
Stack ADT Implementations.
Generic Implementations.
Creation of a New ADT.
FIFO Queues and Generalized Queues.
Duplicate and Index Items.
First-Class ADTs.
Application-Based ADT Example.
Perspective.

5. Recursion and Trees.
Recursive Algorithms.
Divide and Conquer.
Dynamic Programming.
Trees.
Mathematical Properties of Trees.
Tree Traversal.
Recursive Binary-Tree Algorithms.
Graph Traversal.
Perspective.

III. SORTING.

6. Elementary Sorting Methods.
Rules of the Game.
Generic Sort Implementations.
Selection Sort.
Insertion Sort.
Bubble Sort.
Performance Characteristics of Elementary Sorts.
Algorithm Visualization.
Shellsort.
Sorting Linked Lists.
Key-Indexed Counting.

7. Quicksort.
The Basic Algorithm.
Performance Characteristics of Quicksort.
Stack Size.
Small Subfiles.
Median-of-Three Partitioning.
Duplicate Keys.
Strings and Vectors.
Selection.

8. Merging and Mergesort.
Two-Way Merging.
Abstract In-Place Merge.
Top-Down Mergesort.
Improvements to the Basic Algorithm.
Bottom-Up Mergesort.
Performance Characteristics of Mergesort.
Linked-List Implementations of Mergesort.
Recursion Revisited.

9. Priority Queues and Heapsort.
Elementary Implementations.
Heap Data Structure.
Algorithms on Heaps.
Heapsort.
Priority-Queue ADT.
Priority Queues for Client Arrays.
Binomial Queues.

10. Radix Sorting.
Bits, Bytes, and Words.
Binary Quicksort.
MSD Radix Sort.
Three-Way Radix Quicksort.
LSD Radix Sort.
Performance Characteristics of Radix Sorts.
Sublinear-Time Sorts.

11. Special-Purpose Sorting Methods.
Batcher's Odd-Even Mergesort.
Sorting Networks.
Sorting In Place.
External Sorting.
Sort-Merge Implementations.
Parallel Sort-Merge.

IV. SEARCHING.

12. Symbol Tables and BSTs.
Symbol-Table Abstract Data Type.
Key-Indexed Search.
Sequential Search.
Binary Search.
Index Implementations with Symbol Tables.
Binary Search Trees.
Performance Characteristics of BSTs.
Insertion at the Root in BSTs.
BST Implementations of Other ADT Functions.

13. Balanced Trees.
Randomized BSTs.
Splay BSTs.
Top-Down 2-3-4 Trees.
Red-Black Trees.
Skip Lists.
Performance Characteristics.

14. Hashing.
Hash Functions.
Separate Chaining.
Linear Probing.
Double Hashing.
Dynamic Hash Tables.
Perspective.

15. Radix Search.
Digital Search Trees.
Tries.
Patricia Tries.
Multiway Tries and TSTs.
Text-String-Index Applications.

16. External Searching.
Rules of the Game.
Indexed Sequential Access.
B Trees.
Extendible Hashing.
Perspective.

Appendix.

Digital Rights

eBook Requirements
VitalSource Bookshelf Reader
Minimum System Requirements:
  • Windows 7/8, or Mac OS X 10.6 or above
Software Requirements:

eTextbooks and eChapters can be viewed by using the free reader listed below.

Be sure to check the format of the eTextbook/eChapter you purchase to know which reader you will need. After purchasing your eTextbook or eChapter, you will be emailed instructions on where and how to download your free reader.

Download Requirements:

Due to the size of eTextbooks, a high-speed Internet connection (cable modem, DSL, LAN) is required for download stability and speed. Your connection can be wired or wireless.

Being online is not required for reading an eTextbook after successfully downloading it. You must only be connected to the Internet during the download process.

User Help:

Click Here to access the VitalSource Bookshelf FAQ

Digital Rights
VitalSource Bookshelf
Copying: Allowed, 2 selections may be copied every 365 days
Printing: Allowed, 2 prints for 365 days
Expires: Yes, may be used for 365 days after activation
Reading Aloud: Allowed
Sharing: Not Allowed
Min. Software Version: VitalSource Bookshelf
Suitable Devices: PCs, Tablet PCs, Macs, Laptops


Digital Rights Management (DRM) Key


Copying - Books that cannot be copied will show "Not Allowed." Otherwise, this will detail the number of times it can be copied, or "Allowed with no limits."

Printing - Books that cannot be printed will show "Not Allowed." Otherwise, this will detail the number of times it can be printed, or "Allowed with no limits."

Expires - Books that have no expiration (the date upon which you will no longer be able to access your eBook) will read "No Expiration." Otherwise it will state the number of days from activation (the first time you actually read it).

Reading Aloud - Books enabled with the "text-to-speech" feature so that they can be read aloud will show "Allowed."

Sharing - Books that cannot be shared with other computers will show "Not Allowed."

Min. Software Version - This is the minimum software version needed to read this book.

Suitable Devices - Hardware known to be compatible with this book. Note: Reader software still needs to be installed.