Essential algorithms and Data structures (second edition) book – source code for programs

Algorithms include:

1. A*
2. Binary search
3. Binary tree with an array
4. Binary tree with objects
5. Bubble sort
6. Dictionary
7. Dijkstra’s shortest path
8. Graph – breadth first traversal
9. Graph – depth first traversal (iterative)
10. Graph – depth first search traversal (recursive)
11. Hash table search
12. Insertion sort
13. Linear search
14. Linked list with an array
15. Linked list with objects
16. Merge sort (iterative)
17. Merge sort (recursive method 1)
18. Merge sort (recursive method 2)
19. Queue (circular) with an array
20. Quicksort (Hoare method)
21. Quicksort (Lomuto method)
22. Quicksort (Variant method)
23. Stack with an array
24. Stack with objects