Data.Structures.and.Algorithms.USING.C

Helping readers build efficient C data structures, this handbook explains how to apply data structures to enhance program execution. With a strong emphasis on structured design and programming techniques, it features precise instructions on all the steps involved in data structure development-from theoretical conception to concrete realization. Table of Contents BASICS 1. Overview 2. Environment Setup ALGORITHM 3. Algorithms ─ Basics 4. Asymptotic Analysis 5. Greedy Algorithms 6. Divide & Conquer 7. Dynamic Programming DATA STRUCTURES 8. Basic Concepts 9. Arrays LINKED LIST 10. Linked List ─ Basics 11. Doubly Linked List 12. Circular Linked List STACK & QUEUE 13. Stack 14. Expression Parsing 15. Queue SEARCHING TECHNIQUES 16. Linear Search 17. Binary Search 18. Interpolation Search 19. Hash Table SORTING TECHNIQUES 20. Sorting Algorithm 21. Bubble Sort Algorithm 22. Insertion Sort 23. Selection Sort 24. Merge Sort Algorithm 25. Shell Sort 26. Quick Sort GRAPH DATA STRUCTURE 27. Graphs 28. Depth First Traversal 29. Breadth First Traversal TREE DATA STRUCTURE 30. Tree 31. Tree Traversal 32. Binary Search Tree 33. AVL Trees 34. Spanning Tree 35. Heaps RECURSION 36. Recursion ─ Basics 37. Tower of Hanoi 38. Fibonacci Series