Data Structure and Algorithms

Algorithms and data structures are the most integral notion in computing. They are the building blocks from which complex software is built. Having an understanding of these foundation concepts is hugely important in software design.The study of algorithms is also important because it trains us to think very specifically about certain problems. It can serve to increase our mental and problem solving abilities by helping us isolate the components of a problem and define relationships between these components.

1. Linear Search

2. Binary Search

3. Interpolation Search

4. Bubble Sort

5. Quick Sort

6. Selection Sort

7. Shell Sort

8. Insertion Sort

9. Comb Sort

10. Merge Sort

11. Radix Sort

12. Pancake Sort

13. Binary Tree

14. Linked List

15. Rabin-Karp Algorithm

16. LIFO Stack and FIFO Queue

17. Median of Medians

18. Longest Common Sub-sequence

19. Levenshtein distance

20. Knuth-Morris-Pratt (KMP) Algorithm

21. Floyd-Warshall Algorithm

22. Tower of Hanoi

23. Huffman Coding

24. Drawing Cuboid

25. Random Maze Generator

26. ZigZag Matrix

27. Spiral Matrix

28. AVL Trees

29. Permutations Generator

30. LZW Data Compression

31. NUMERIC SLICE PERMUTATION GENERATOR