What Will You Learn?

• Introduction & Motivation
• Recap of Function, Recursion
• Euclid's Greatest Common Divisor
• Asymptotic Notation
• Complexity Analysis
• Searching & Sorting (Binary, Bubble, Selection, Merge and Quick Sort)
• Greedy Approach (Coin Change, Bin Packing, Knapsack, Huffman Coding)
• Dynamic Programming (Fibonacci Numbers, Coin Change, Knapsack, LIS, LCS, Chain Multiplication)
• BackTracking Basic & Permutation Generator
• Graph (BFS, DFS)
• Topological Sort & SCC
• Minimum Spanning Tree & (Kruskal's, Prim's, Dijkstra's, Bellman Ford)
• Shortest Path
• Q-bit programming Contest