🔢 Sorting Algorithms

• 🫧 Bubble Sort — swap neighbors again & again (slow 🐢)
• 🎯 Selection Sort — pick minimum and place it correctly
• 🧩 Insertion Sort — insert like playing cards ♠️
• ⚡ Quick Sort — divide by pivot (fast on average 🚀)
• 🧬 Merge Sort — divide → sort → merge (stable)
• 🏗️ Heap Sort — uses heap data structure
• 🔢 Radix Sort — digit-by-digit sorting
• 🐚 Shell Sort — gap-based insertion sort
• 🪣 Bucket Sort — distribute into buckets, then sort
• 🧮 Counting Sort — count frequencies (non-comparison)

---

🔍 Searching Algorithms

• 🚶 Linear Search — check one by one
• 🔎 Binary Search — works only on sorted data 📏
• 🦘 Jump Search — jump ahead in fixed blocks
• 📈 Interpolation Search — predicts position
• 🚀 Exponential Search — expands range exponentially
• 🔗 Sublist Search — find linked list inside another
• 🧠 Boyer–Moore Algorithm — smart string skipping
• 🔐 Rabin–Karp Algorithm — hashing + string matching
• 🗂️ Hashing — O(1) average lookup
• 🔺 Ternary Search — split into three parts

---

🧠 Divide and Conquer

• 🔎 Binary Search — split & conquer
• 🧬 Merge Sort — recursive merging
• ⚡ Quick Sort — partition around pivot
• 📍 Closest Pair of Points — geometry problem
• 🧮 Strassen’s Matrix Multiplication — faster matrix multiply
• ✖️ Karatsuba Multiplication — fast large number multiplication
• 📉 Maximum Subarray Problem — Kadane + D&C
• 🌊 FFT (Fast Fourier Transform) — signal processing
• 🔄 Counting Inversions — measure disorder
• 🗼 Tower of Hanoi — classic recursion puzzle

---

💰 Greedy Algorithms

• 🗓️ Activity Selection Problem — max non-overlapping tasks
• 🎒 Fractional Knapsack — take fractions
• 🔤 Huffman Coding — optimal compression
• 🧑‍💼 Job Scheduling Problem — maximize profit
• 🌲 Prim’s Algorithm — minimum spanning tree
• 🛣️ Dijkstra’s Algorithm — shortest path (no negative edges)
• 🔗 Kruskal’s Algorithm — MST using sorting + union-find

---

🧮 Dynamic Programming (DP)

• 🎒 0/1 Knapsack — pick or skip
• ♾️ Unbounded Knapsack — unlimited items
• 💰 Coin Change — number of ways / min coins
• 🪢 Rope Cutting — maximize product
• 🔗 LCS (Longest Common Subsequence) — string matching
• 📈 LIS (Longest Increasing Subsequence) — sequence DP
• 🔢 MCM (Matrix Chain Multiplication) — parenthesization
• 🚦 Bellman–Ford — shortest path (negative edges allowed)
• 🌐 Floyd–Warshall — all-pairs shortest path