 |
Beginning Algorithms View Larger Image | Simon Harris, James Ross
Wrox Press, Paperback, Published October 2005, 432 pages, ISBN 0764596748 | List Price: $39.99
Our Price: $24.95
You Save: $15.04 (38% Off)
| | | Availability: Out-Of-Stock |
Be the First to Write a Review and tell the world about this title!People who purchase this book frequently purchase: - Professional ASP.NET 2.0; Bill Evjen, et al, $31.50, 37% Off!
- Java Concurrency in Practice; Brian Goetz, et al, $34.50, 37% Off!
- Java Puzzlers: Traps, Pitfalls, and Corner Cases; Joshua Bloch, et al, $31.50, 21% Off!
- Programming Microsoft Windows Forms: A Streamlined Approach Using C#; Charles Petzold, $24.95, 38% Off!
Books on similar topics, in best-seller order:Books from the same publisher, in best-seller order:
After guiding readers through the basics of algorithms and data structures,
this book examines specific algorithms that will help readers in programming
tasks Begins with a discussion of the basics-how to determine the characteristics
of a given algorithm-then introduces practical sorting algorithms, and gradually
moves on to fundamental data structures Companion Web site features unique,
Java-based working implementations and examples built and tested by the author.
Table of Contents
Introduction.
Chapter 1: Getting Started.
Chapter 2: Iteration and Recursion.
Chapter 3: String Searching.
Chapter 4: Lists.
Chapter 5: Queues.
Chapter 6: Stacks.
Chapter 7: Basic Sorting.
Chapter 8: Advance Sorting.
Chapter 9: Priority Queues.
Chapter 10: Binary Searching.
Chapter 11: Binary Search Trees.
Chapter 12: Red-Black Trees.
Chapter 13: Hashing.
Chapter 14: Sets.
Chapter 15: Maps.
Chapter 16: Computational Geometry.
Chapter 17: Digital Search Trees.
Chapter 18: B-Trees.
Chapter 19: Pragmatic Optimisation.
Appendix A: Further Reading.
Appendix B: Resources.
Appendic C: Bibliography.
Index.
|
|
