Algorithms and data structures : an approach in C

With numerous practical, real-world algorithms presented in the C programming language, Bowman's Algorithms and Data Structures: An Approach in C is the algorithms text for courses that take a modern approach. For the one- or two-semester undergraduate course in data structures, it instructs students on the science of developing and analysing algorithms. Bowman focuses on both the theoretical and practical aspects of algorithm development. He discusses problem-solving techniques and introduces the concepts of data abstraction and algorithm efficiency. More importantly, the text does not present algorithms in a "shopping-list" format. Rather it provides actual insight into the design process itself With numerous practical, real-world algorithms presented in the C programming language, Bowman's Algorithms and Data Structures: An Approach in C is the algorithms text for courses that take a modern approach. For the one- or two-semester undergraduate course in data structures, it instructs students on the science of developing and analyzing algorithms. Bowman focuses on both the theoretical and practical aspects of algorithm development. He discusses problem-solving techniques and introduces the concepts of data abstraction and algorithm efficiency. More importantly, the text does not present algorithms in a "shopping-list" format. Rather it provides actual insight into the design process itself This volume focuses on both the theoretical and practical aspects of algorithm development. It discusses problem-solving techniques, introduces the concepts of data abstraction and algorithm efficiency, and contains numerous practical, real-world algorithms presented in the C programming language. Content: 1. Introduction --- 2. Algorithm Design --- 3. Static Data Structures --- 4. Recursion --- 5. Dynamic Data Structures --- 6. Trees --- 7. Graphs and Digraphs --- 8. Searching --- 9. Sorting Techniques ---- Appendix A. Acrostic Puzzle --- Appendix B.C for Programmers.