- The MIT recommended order for watching this is 6.042J (Mathematics for Computer Science) ,
- then 6.006 (Introduction to Algorithms) and
- finally 6.046J (Analysis and Design of Algorithms).
- Intro: https://www.youtube.com/playlist?list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb
- Design: https://www.youtube.com/playlist?list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp
- Advanced: https://www.youtube.com/playlist?list=PL6ogFv-ieghdoGKGg2Bik3Gl1glBTEu8c
- count of prime numbers below given positive integer/number N
solve using Sieve of Eratosthenes with Time Complexity O(nlog(log(n))) & O(sqrt(n)log(log(n)))