Flylib.com
Algorithms in Java, Parts 1-4 (3rd Edition) (Pts.1-4)
Algorithms in Java, Parts 1-4 (3rd Edition) (Pts.1-4)
ISBN: 0201361205
EAN: 2147483647
Year: 2002
Pages: 158
Authors:
Robert Sedgewick
BUY ON AMAZON
Algorithms in Java: Parts 1-4, Third Edition
Table of Contents
Book Cover
Copyright
Preface
Scope
Use in the Curriculum
Algorithms of Practical Use
Programming Language
Acknowledgments
Java Consultant s Preface
Notes on Exercises
Part I: Fundamentals
Chapter 1. Introduction
1.1 Algorithms
1.2 A Sample Problem: Connectivity
1.3 Union-Find Algorithms
1.4 Perspective
1.5 Summary of Topics
Chapter 2. Principles of Algorithm Analysis
2.1 Implementation and Empirical Analysis
2.2 Analysis of Algorithms
2.3 Growth of Functions
2.4 Big-Oh Notation
2.5 Basic Recurrences
2.6 Examples of Algorithm Analysis
2.7 Guarantees, Predictions, and Limitations
References for Part One
Part II: Data Structures
Chapter 3. Elementary Data Structures
3.1 Building Blocks
3.2 Arrays
3.3 Linked Lists
3.4 Elementary List Processing
3.5 Memory Allocation for Lists
3.6 Strings
3.7 Compound Data Structures
Chapter 4. Abstract Data Types
Exercises
4.1 Collections of Items
4.2 Pushdown Stack ADT
4.3 Examples of Stack ADT Clients
4.4 Stack ADT Implementations
4.5 Generic Implementations
4.6 Creation of a New ADT
4.7 FIFO Queues and Generalized Queues
4.8 Duplicate and Index Items
4.9 First-Class ADTs
4.10 Application-Based ADT Example
4.11 Perspective
Chapter 5. Recursion and Trees
5.1 Recursive Algorithms
5.2 Divide and Conquer
5.3 Dynamic Programming
5.4 Trees
5.5 Mathematical Properties of Binary Trees
5.6 Tree Traversal
5.7 Recursive Binary-Tree Algorithms
5.8 Graph Traversal
5.9 Perspective
References for Part Two
Part III: Sorting
Chapter 6. Elementary Sorting Methods
6.1 Rules of the Game
6.2 Generic Sort Implementations
6.3 Selection Sort
6.4 Insertion Sort
6.5 Bubble Sort
6.6 Performance Characteristics of Elementary Sorts
6.7 Algorithm Visualization
6.8 Shellsort
6.9 Sorting of Linked Lists
6.10 Key-Indexed Counting
Chapter 7. Quicksort
7.1 The Basic Algorithm
7.2 Performance Characteristics of Quicksort
7.3 Stack Size
7.4 Small Subfiles
7.5 Median-of-Three Partitioning
7.6 Duplicate Keys
7.7 Strings and Vectors
7.8 Selection
Chapter 8. Merging and Mergesort
8.1 Two-Way Merging
8.2 Abstract In-Place Merge
8.3 Top-Down Mergesort
8.4 Improvements to the Basic Algorithm
8.5 Bottom-Up Mergesort
8.6 Performance Characteristics of Mergesort
8.7 Linked-List Implementations of Mergesort
8.8 Recursion Revisited
Chapter 9. Priority Queues and Heapsort
Exercises
9.1 Elementary Implementations
9.2 Heap Data Structure
9.3 Algorithms on Heaps
9.4 Heapsort
9.5 Priority-Queue ADT
9.6 Priority Queues for Client Arrays
9.7 Binomial Queues
Chapter 10. Radix Sorting
10.1 Bits, Bytes, and Words
10.2 Binary Quicksort
10.3 MSD Radix Sort
10.4 Three-Way Radix Quicksort
10.5 LSD Radix Sort
10.6 Performance Characteristics of Radix Sorts
10.7 Sublinear-Time Sorts
Chapter 11. Special-Purpose Sorting Methods
11.1 Batcher s Odd-Even Mergesort
11.2 Sorting Networks
11.3 Sorting In Place
11.4 External Sorting
11.5 Sort-Merge Implementations
11.6 Parallel Sort-Merge
References for Part Three
Part IV: Searching
Chapter 12. Symbol Tables and Binary Search Trees
12.1 Symbol-Table Abstract Data Type
12.2 Key-Indexed Search
12.3 Sequential Search
12.4 Binary Search
12.5 Index Implementations with Symbol Tables
12.6 Binary Search Trees
12.7 Performance Characteristics of BSTs
12.8 Insertion at the Root in BSTs
12.9 BST Implementations of Other ADT Operations
Chapter 13. Balanced Trees
Exercises
13.1 Randomized BSTs
13.2 Splay BSTs
13.3 Top-Down 2-3-4 Trees
13.4 Red-Black Trees
13.5 Skip Lists
13.6 Performance Characteristics
Chapter 14. Hashing
14.1 Hash Functions
14.2 Separate Chaining
14.3 Linear Probing
14.4 Double Hashing
14.5 Dynamic Hash Tables
14.6 Perspective
Chapter 15. Radix Search
15.1 Digital Search Trees
15.2 Tries
15.3 Patricia Tries
15.4 Multiway Tries and TSTs
15.5 Text-String-Index Algorithms
Chapter 16. External Searching
16.1 Rules of the Game
16.2 Indexed Sequential Access
16.3 B Trees
16.4 Extendible Hashing
16.5 Perspective
References for Part Four
Appendix
Exercises
Algorithms in Java, Parts 1-4 (3rd Edition) (Pts.1-4)
ISBN: 0201361205
EAN: 2147483647
Year: 2002
Pages: 158
Authors:
Robert Sedgewick
BUY ON AMAZON
SQL Hacks
Hack 15. Search for Keywords Without LIKE
Hack 46. Store Images in a Database
Hack 58. Store Parameters in the Database
Hack 64. Determine Your Isolation Level
Hack 92. Deploy Applications
Google Maps Hacks: Tips & Tools for Geographic Searching and Remixing
Hack 20. Track Official Storm Reporting
Hacks 4250: Introduction
Hack 52. Put a Map and HTML into Your Info Windows
Hack 64. Build Custom Icons on the Fly
Hack 68. Automatically Cut and Name Custom Map Tiles
Logistics and Retail Management: Emerging Issues and New Challenges in the Retail Supply Chain
Retail Logistics: Changes and Challenges
Relationships in the Supply Chain
Logistics in Tesco: Past, Present and Future
Transforming Technologies: Retail Exchanges and RFID
Enterprise Resource Planning (ERP) Systems: Issues in Implementation
File System Forensic Analysis
Summary
Introduction
Introduction
Group Descriptor Tables
Cylinder Group Summary
Microsoft Visual Basic .NET Programmers Cookbook (Pro-Developer)
Numbers, Dates, and Other Data Types
Objects, Interfaces, and Patterns
Windows Services
ADO.NET
Web Services
User Interfaces in C#: Windows Forms and Custom Controls
Control Class Basics
Modern Controls
Data Controls
MDI Interfaces and Workspaces
GDI+ Basics
flylib.com © 2008-2017.
If you may any questions please contact us: flylib@qtcs.net
Privacy policy
This website uses cookies. Click
here
to find out more.
Accept cookies