|Author||: Simon Harris|
|Publisher||: John Wiley & Sons|
|Total Pages||: 600|
|Rating||: 4/5 (31 Downloads)|
Book excerpt: Beginning Algorithms A good understanding of algorithms, and the knowledge of when toapply them, is crucial to producing software that not only workscorrectly, but also performs efficiently. This is the only book toimpart all this essential information-from the basics ofalgorithms, data structures, and performance characteristics to thespecific algorithms used in development and programming tasks. Packed with detailed explanations and instructive examples, thebook begins by offering you some fundamental data structures andthen goes on to explain various sorting algorithms. You'll thenlearn efficient practices for storing and searching by way ofhashing, trees, sets, and maps. The authors also share tips onoptimization techniques and ways to avoid common performancepitfalls. In the end, you'll be prepared to build the algorithmsand data structures most commonly encountered in day-to-daysoftware development. What you will learn from this book The basics of algorithms, such as iteration and recursion Elementary data structures such as lists, stacks, andqueues Basic and advanced sorting algorithms including insertion sort,quicksort, and shell sort Advanced data structures such as binary trees, ternary trees,and heaps Algorithms for string searching, string matching, hashing, andcomputational geometry How to use test-driven development techniques to ensure yourcode works as intended How to dramatically improve the performance of your code withhands-on techniques for profiling and optimization Who this book is for This book is for anyone who develops applications, or is justbeginning to do so, and is looking to understand algorithms anddata structures. An understanding of computer programming isbeneficial. Wrox Beginning guides are crafted to make learning programminglanguages and technologies easier than you think, providing astructured, tutorial format that will guide you through all thetechniques involved.