Algorithms Analysis and Design

This repository contains the materials and code implementations for the "Algorithms Analysis and Design from Scratch" course. The course covers various algorithms, their analysis, and design principles. For more details, visit the course page.

Table of Contents

1. Circle Area

2. Sigma Notation - Standard Deviation

3. Standard Deviation

4. Algorithms Analysis - Introduction

5. Algorithms Analysis - Calculus Function

6. Algorithms Analysis - Big O Notation

7. Algorithms Analysis - Drawing Complexity classes on graph

8. Insertion Sort

9. Recursion - Divide & Conquer - Merge Sort

10. Divide & Conquer - Merge Sort

11. Binary Search

12. Segregate Positive and Negative Numbers

13. Calculus - Optimization Problems - Max Profit Example

14. Greedy Algorithm - Introduction

15. Greedy Algorithm - Activity Selection Problem

16. Sorted Characters Frequencies

17. Greedy Algorithm - Huffman Coding

18. Greedy Algorithm - Fractional Knapsack Problem

19. Dynamic Programming - Stagecoach Problem

20. Dynamic Programming - Longest Common Subsequence

21. Dynamic Programming - 0/1 Knapsack Problem

22. Graph - Introduction

23. Graph - Prim’s Minimum Spanning Tree

24. Graph - Breadth First Search

25. Graph - Depth First Search

26. Graph - Dijkstra’s Shortest Path