Course Hive
Search

Welcome

Sign in or create your account

Continue with Google
or
Sieve Algorithm: How to find Prime Numbers Optimally ? | CP Course | EP 59
Play lesson

Competitive Programming/DSA Course | Hindi - Sieve Algorithm: How to find Prime Numbers Optimally ? | CP Course | EP 59

4.0 (2)
35 learners

What you'll learn

This course includes

  • 35.3 hours of video
  • Certificate of completion
  • Access on mobile and TV

Summary

Full Transcript

NUMBER THEORY PLAYLIST : https://youtube.com/playlist?list=PLauivoElc3giVROwL-6g9hO-LlSen_NaV FREE COMPETITIVE PROGRAMMING COURSE PLAYLIST : https://youtube.com/playlist?list=PLauivoElc3ggagradg8MfOZreCMmXMmJ- Today we talk about how you can find prime numbers optimally using sieve algorithm. Sieve is very important and must know algorithm for all the programmers. Timestamps: Algorithm : (0:00) Code : (4:30) Time complexity : (10:55) Be a part of our awesome Community. Join ○ Discord : https://discord.gg/GMH23tq7Y7 ○ Telegram : https://t.me/LuvIsMeYT You can follow me on below platforms for all the latest updates ○ Instagram : https://www.instagram.com/i._m_.luv/ ○ Twitter : https://twitter.com/Luvk1412 ○ Linkedin : https://www.linkedin.com/in/luvk1412/ Blog(Not frequently updated) ○ Blog : https://www.codewithluv.in Hashtags #sieve #primes #algorithm #numbertheory

Course Hive

Continue this lesson in the app

Install CourseHive on Android or iOS to keep learning while you move.

Related Courses

FAQs

Course Hive
Download CourseHive
Keep learning anywhere