Algorithms in Java

ISBN-10: 0201361205

ISBN-13: 9780201361209

Edition: 3rd 2003 (Revised)

Authors: Robert Sedgewick

List price: $69.99
eBook available
30 day, 100% satisfaction guarantee

If an item you ordered from TextbookRush does not meet your expectations due to an error on our part, simply fill out a return request and then return it by mail within 30 days of ordering it for a full refund of item cost.

Learn more about our returns policy


For 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.
eBooks Starting from $55.99
Buy eBooks
what's this?
Rush Rewards U
Members Receive:
You have reached 400 XP and carrot coins. That is the daily max!
Study Briefs

Limited time offer: Get the first one free! (?)

All the information you need in one place! Each Study Brief is a summary of one specific subject; facts, figures, and explanations to help you learn faster.

Add to cart
Study Briefs
Periodic Table Online content $4.95 $1.99
Add to cart
Study Briefs
SQL Online content $4.95 $1.99
Add to cart
Study Briefs
MS Excel® 2010 Online content $4.95 $1.99
Add to cart
Study Briefs
MS Word® 2010 Online content $4.95 $1.99
Customers also bought

Book details

List price: $69.99
Edition: 3rd
Copyright year: 2003
Publisher: Addison Wesley Professional
Publication date: 7/23/2002
Binding: Paperback
Pages: 768
Size: 8.00" wide x 9.50" long x 1.25" tall
Weight: 2.068
Language: English

A Sample Problem: Connectivity
Union-Find Algorithms
Summary of Topics
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
Data Structures
Elementary Data Structures
Building Blocks
Linked Lists
Elementary List Processing
Memory Allocation for Lists
Compound Data Structures
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
Recursion and Trees
Recursive Algorithms
Divide and Conquer
Dynamic Programming
Mathematical Properties of Trees
Tree Traversal
Recursive Binary-Tree Algorithms
Graph Traversal
Elementary Sorting Methods
Rules of the Game
Generic Sort Implementations
Selection Sort
Insertion Sort
Bubble Sort
Performance Characteristics of Elementary Sorts
Algorithm Visualization
Sorting Linked Lists
Key-Indexed Counting
The Basic Algorithm
Performance Characteristics of Quicksort
Stack Size
Small Subfiles
Median-of-Three Partitioning
Duplicate Keys
Strings and Vectors
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
Priority Queues and Heapsort
Elementary Implementations
Heap Data Structure
Algorithms on Heaps
Priority-Queue ADT
Priority Queues for Client Arrays
Binomial Queues
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
Special-Purpose Sorting Methods
Batcher's Odd-Even Mergesort
Sorting Networks
Sorting In Place
External Sorting
Sort-Merge Implementations
Parallel Sort-Merge
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 Operations
Balanced Trees
Randomized BSTs
Splay BSTs
Top-Down 2-3-4 Trees
Red-Black Trees
Skip Lists
Performance Characteristics
Hash Functions
Separate Chaining
Linear Probing
Double Hashing
Dynamic Hash Tables
Radix Search
Digital Search Trees
Patricia Tries
Multiway Tries and TSTs
Text-String-Index Applications
External Searching
Rules of the Game
Indexed Sequential Access
B Trees
Extendible Hashing
Free shipping on orders over $35*

*A minimum purchase of $35 is required. Shipping is provided via FedEx SmartPost® and FedEx Express Saver®. Average delivery time is 1 – 5 business days, but is not guaranteed in that timeframe. Also allow 1 - 2 days for processing. Free shipping is eligible only in the continental United States and excludes Hawaii, Alaska and Puerto Rico. FedEx service marks used by permission."Marketplace" orders are not eligible for free or discounted shipping.

Learn more about the TextbookRush Marketplace.