What is Algorithm?

"An algorithm is a precise sequence of instructions for solving a particular problem or accomplishing a specific task." - Donald Knuth
​
"An algorithm is like a recipe. It takes inputs (ingredients) and produces an output (the finished dish)." - Vint Cerf

---

• 1. Insertion Sort
• 2. Merge Sort
• 3. Bubble Sort
• 4. Divide and Conquer - Max Crossing Subarray
• 5. Strassen Matrix Multiplication
• 6. Hiring Assistant
• 7. Heap Sort - Min Heap
• 8. Heap Sort - Max Heap
• 9. Quick Sort - Lomuto
• 10. Quick Sort - Hoare
• 11. Fuzzy Sort
• 12. Counting Sort
• 13. Radix Sort
• 14. Bucket Sort
• 15. Selection Sort - Random
• 16. Selection Sort - Median
• 17. Bead Sort
• 18. Bitonic Sort
• 19. Block Sort
• 20. Cocktail Sort
• 21. Comb Sort
• 22. Cube Sort
• 23. Cycle Sort
• 24. Gnome Sort
• 25. Library Sort
• 26. Pancake Sort
• 27. Patience Sort
• 28. Pigeon-Hole Sort
• 29. Shell Sort
• 30. SmoothSort
• 31. Timsort
• 32. Binary Search
• 33. DFS
• 34. BFS
• 35. Best First Search
• 36. Dijkstra's Algorithm
• 37. Bellman-Ford
• 38. A-Star Search
• 39. IDDFS Search
• 40. Bidirectional Search