01Bubble Sort02Selection Sort03Insertion Sort04Merge Sort05Quicksort06Heapsort07Counting Sort08Radix Sort09Binary Search10Interpolation Search11QuickSelect12Exponential Search13Binary Search Tree14AVL Tree15Red-Black Tree16Heap and Priority Queue17Segment Tree18Fenwick Tree (BIT)19Trie20Hash Table21Breadth-First Search (BFS)22Depth-First Search (DFS)23Dijkstra's Shortest Path24Bellman-Ford Algorithm25Floyd-Warshall26Kruskal's MST Algorithm27Prim's MST Algorithm280/1 Knapsack29Longest Common Subsequence (LCS)30Union-Find (Disjoint Set Union)31Edit Distance (Levenshtein)32Topological Sort (Kahn's Algorithm)33Coin Change34Longest Increasing Subsequence (LIS)35Tarjan's Strongly Connected Components36Rod Cutting Problem37Egg Drop Problem38Skip List39Bloom Filter40Comparison Sort Lower Bound41Fibonacci Heap42Network Flow43Amortized Analysis44NP-Completeness45Matrix Chain Multiplication46B-Tree47Randomized Algorithms48van Emde Boas Tree