Design and analysis of algorithms involves creating and evaluating efficient algorithms for solving computational problems in computer science.
| SNo. | Topic |
|---|---|
| 1 | Greedy Algorithm |
| 1.1 | Fractional Knapsack |
| 1.2 | Huffman Coding |
| 2 | Divide and Conquer |
| 2.1 | Maximum Subarray |
| 2.2 | Karatsuba Faster Integer Multiplication |
| 3 | Dynamic Programming |
| 3.1 | Insertion Sort |
| 4 | String Matching Algorithm |
| 4.1 | Naive String Algorithm |