Beschreibung
InhaltsangabeAcknowledgments. Introduction. Chapter 1: Getting Started. Chapter 2: Iteration and Recursion. Chapter 3: Lists. Chapter 4: Queues. Chapter 5: Stacks. Chapter 6: Basic Sorting. Chapter 7: Advanced Sorting. Chapter 8: Priority Queues. Chapter 9: Binary Searching and Insertion. Chapter 10: Binary Search Trees. Chapter 11: Hashing. Chapter 12: Sets. Chapter 13: Maps. Chapter 14: Ternary Search Trees. Chapter 15: B-Trees. Chapter 16: String Searching. Chapter 17: String Matching. Chapter 18: Computational Geometry. Chapter 19: Pragmatic Optimization. Appendix A: Further Reading. Appendix B: Resources. Appendix C: Bibliography. Appendix D: Answers to Exercises. Index.
Autorenporträt
Simon Harris started writing animated sprites on a Commodore 64 in primary school. After a break of many years, he taught himself 80x86 and IBM System/370 assembler and started working professionally. Since then he has moved from assembler to C, C++, and, of course, Java. He believes a fundamental understanding and appreciation of algorithms is essential to developing good software; and since starting his own company, RedHill Consulting, he has managed to make a living discussing and demonstrating software development practices and techniques to anyone who will listen. In his more than 15 years of development experience, James Ross has ranged from building packaged products to large enterprise systems to research into compilers and languages. In recent years, he has become a code quality fanatic and agile methods specialist, particularly with test-driven development. He works as a consultant for ThoughtWorks, the world's leading agile software development company. He is currently leading the development of a large J2EE project in the insurance industry in Melbourne, Australia. He lives with his wife and family in Melbourne.
