Bibliographic record and links to related information available from the Library of Congress catalog.
Note: Contents data are machine generated based on pre-publication provided by the publisher. Contents may have variations from the printed book or be incomplete or contain other coding.
Contents Topic - Introduction - Who Should Read This Book? - Pre-Requisite Knowledge Basic programming - What You Will Learn - What You Will Not Learn - How to program - What arrays are - Threading and Synchronization - How to Use This Book * Principles of The Approach - Chapter 1: Getting Started - What are Algorithms? - Example - Performance - Summary * Chapter 2: Iteration and Recursion - Chapter 3: String Searching - Naive - Boyer-Moore - Searching Through Files - Chapter 4: Lists - Chapter 5: Queues - Chapter 6: Stacks - Chapter 7: Basic Sorting - Chapter 8: Advance Sorting - Chapter 9: Priority Queues - Heaps - Chapter 10: Binary Searching - Chapter 11: Binary Search Trees - Chapter 12: Red-Black Trees - Chapter 13: Hashing - Naive - Polynomial - Soundex - Chapter 14: Sets - Chapter 15: Maps - Chapter 16: Computational Geometry - Determining where two lines instersect - Finding the closest pair of points - Triangulation - Chapter 17: Digital Search Trees - Chapter 18: B-Trees - Chapter 19: Pragmatic Optimisation - Appendix A: Further Reading - Appendix B: Resources - Appendix C: Bibliography - Design Patterns (Gamma et. al.) - The Pragmatic Programmer - Introduction to Algorithms (Cormen et. al.) - Effective Java (Joshua Bloch) - The Art of Computer Programming (Donald Knuth) - Unicode Home Pagewww.unicode.org <http://www.unicode.org/> - Dictionary of algorithms and Data Structureswww.nist.gov-dads <http://www.nist.gov/dads/> - Index
Library of Congress Subject Headings for this publication: