Algorithms and Complexity Analysis
Going beyond the searching and sorting algorithms covered in Data Structures and Algorithms โ how to design, analyse, and prove the efficiency of algorithms using formal complexity analysis, and the major algorithmic design paradigms computer scientists rely on to solve harder problems.
U
Instructor: Umweka Academy
๐ 8 lessons
โฑ 3.3h content
๐ฅ 0 enrolled
๐ฏ Advanced
๐
Certificate included
๐ฌ
K 0.00
Requires an active subscription
Create Account & Enrol
Sign In
This course includes
- 8 lessons across multiple modules
- 3.3 hours of content
- Videos, PDFs & quizzes
- Certificate of completion
- Lifetime access
What you'll learn
Understand core concepts and fundamentals
Apply knowledge through practical exercises
Solve real-world problems confidently
Build a strong foundation for further study
Pass assessments and earn your certificate
Access instructor support and Q&A
Course Content โ 8 lessons
Introduction: Beyond Big O
Pdf
20m
Formal Asymptotic Analysis: Big O, Omega, and Theta
Pdf
25m
Divide-and-Conquer Algorithms
Pdf
25m
Greedy Algorithms
Pdf
25m
Dynamic Programming: Foundations
Pdf
30m
Dynamic Programming: Applications
Pdf
25m
Recursive Algorithm Analysis
Pdf
25m
NP-Completeness: An Introduction
Pdf
20m
Requirements
- A device with internet access (phone, tablet, or computer)
- Strong foundation in Computer Science is recommended
- Dedication and willingness to learn