Explore essential mathematical concepts for Data Structures and Algorithms, including the Sieve method for finding prime numbers, Euclid's Algorithm for GCD/LCM calculations, and Modular Arithmetic with Fast Exponentiation. Learn through detailed explanations, code demonstrations, and complexity analysis. Gain practical insights with hands-on exercises and access to additional resources like reference articles, code repositories, and community platforms. Follow along with timestamps for easy navigation through topics such as prime number identification, efficient GCD computation, and advanced modular arithmetic techniques.
Basic Maths for DSA - Sieve - Modular Arithmetics - Euclid’s Algorithm
CodeHelp - by Babbar via YouTube
Overview
Syllabus
- Introduction
- Prime Numbers
- Brute Force Approach
- Promotion
- Count Primes [Question 1]
- Sieve of Eratosthenes
- Code
- Complexity Analysis
- Homework
- GCD/HCF
- Euclid’s Algo
- Code
- GCD article
- LCM and GCD
- Modulo Arithmetics
- Fast Exponentiation
- Code
- Homework
Taught by
CodeHelp - by Babbar
