Design and Analysis of Algorithms

Recursion

Recursion Tree Method </br> Master Method

Divide and Conquer

Multiplying large integers Problem </br> Kartasuba Algorithm </br> Binary Search </br> Median of Two Sorted Arrays </br>

Sorting

Merge Sort </br> Quick Sort </br> Bucket Sort </br> Radix Sort </br>

Greedy Algorithm

Knapsack Problem </br> Activity Selection Problem </br> Huffman Coding </br> Finding Minimum Spanning Tree (Not Comming) </br>

Strassen Matrix Multiplication