Algorithm Basics

Master core algorithmic thinking and build a solid foundation for advanced programming

Course Content

πŸ”„
Beginner 90 min

1. Sorting Algorithms

Bubble sort, selection sort, insertion sort, quicksort, merge sort and time complexity analysis

πŸ”
Intermediate 105 min

2. Search & Backtracking

Depth-first search, breadth-first search, backtracking algorithms and pruning optimization

πŸŒ€
Intermediate 95 min

3. Recursion & Recurrence

Recurrence relations, recursive function design, memoization and recursion optimization

πŸ’Ž
Advanced 120 min

4. Dynamic Programming

State transition equations, optimal substructure, overlapping subproblems and classic DP problems

🎯
Intermediate 85 min

5. Greedy Approach

Greedy strategies, local optimal solutions, global optimal solutions and correctness proofs

🌐
Advanced 110 min

6. Graph Algorithms

Graph representation, traversal algorithms, shortest path algorithms, topological sorting and strongly connected components

πŸ”€
Advanced 100 min

7. String Algorithms

String matching, KMP algorithm, string hashing and advanced string processing techniques