-
Sorting Algorithm -
- Exchange Sort,
- Insertion Sort
- Merge Sort
- Randomized Quick Sort
- Heap Sort
- Radix Sort
-
Strassen’s Matrix Multiplication
-
Large Interger Multiplication
-
Longest Common Subsequence (using Dynamic Programming)
-
Shortest Path Detection (using Floyd Algorithm for Random Undirected Graph)
-
Minimum Spanning Tree (using Prim's and Kruskal Algorithm)
-
0/1 Kanpsack Problem (using Brute Force and Dynamic Programming)