Picture 1 of 1

Stock photo

Algorithms in Java, Parts 1-4 - Picture 1 of 1

Algorithms in Java, Parts 1-4 by Robert Sedgewick (2002, Trade Paperback)

Brenham Book Company (507)

93.6% positive feedback

Price:

$70.93

+ $4.25 shipping

Estimated delivery Tue, Jun 17 - Tue, Jun 24

Returns:

30 days returns. Buyer pays for return shipping. If you use an eBay shipping label, it will be deducted from your refund amount.

Condition:

Brand New

For the first time, Sedgewicks 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 Sedgewicks complete work. Its four parts are fundamentals, data structures, sorting, and searching. It has expanded coverage of arrays, linked lists, strings, trees, ADTs, and object-oriented programming.

About this product

Product Identifiers

PublisherAddison Wesley Professional

ISBN-100201361205

ISBN-139780201361209

eBay Product ID (ePID)551469

Product Key Features

Number of Pages768 Pages

LanguageEnglish

Publication NameAlgorithms in Java, Parts 1-4

Publication Year2002

SubjectProgramming / Algorithms, Programming Languages / Java, Software Development & Engineering / Systems Analysis & Design

FeaturesRevised

TypeTextbook

Subject AreaComputers

AuthorRobert Sedgewick

FormatTrade Paperback

Dimensions

Item Height1.2 in

Item Weight42.3 Oz

Item Length9.1 in

Item Width7.8 in

Additional Product Features

Edition Number3

Intended AudienceScholarly & Professional

LCCN98-025050

Volume NumberPts. 1-4

IllustratedYes

Edition DescriptionRevised edition

Table Of ContentI. 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 315. 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 Index Items. 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 Sorts. 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. Index. 0201361205T06262002

SynopsisFor 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., 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., This is a popular textbook on algorithms and data structures now available in Java version. It provides students with practical means to test Java implementations on real applications.

LC Classification NumberQA76.73.J38S4 1998