Discrete Math for Computer Science - Algorithms & Recursion Course
by Coursera
★ 8.7/10
Master algorithms and recursion through discrete math. Learn modular arithmetic, GCD, Euclidean algorithm, and recursive problem solving from HKUST on Coursera.
Why this course
- Covers foundational number theory with direct CS applications
- Clear progression from modular arithmetic to advanced algorithms
- Strong focus on recursive problem-solving techniques
- High-quality instructional content from a reputable institution
Read Full Review of This Course
Enroll Now on Coursera