L4 | Printing Prime Factorisation | Raj (Striver) | Prime Numbers for CP
Вставка
- Опубліковано 29 вер 2024
- In this lecture, Raj (Striver) has covered the Prime Numbers for CP & Printing Prime Factorisation for Competitive Programming.
Raj Sir and other Top Educators take classes on Unacademy App.
Use Special Code “STRIVER” to get 10% off on your Unacademy Subscription 😍
Educator profile: unacademy.com/...
👉🏼 Subscribe today: unacademy.onel...
👉🏼 Goal Upcoming Class page: unacademy.onel...
------------------------------------------
Welcome to CodeBeyond - a new offering from Unacademy!
Learn to code from the World's Top Experts/Coders and get your dream job.
Our aim is to become a one-stop solution and bring to you a plethora of coding-related courses, hacks, information, and trends for all of you to reach your career goals.
We have some of the best educators at Unacademy to help you build the knowledge and skills in your chosen field, right from a beginner to a pro-level!
Subscribe to know more!
Do Subscribe and be a part of the community for more such lessons here:
👉🏼 Subscribe to our channel: bit.ly/3vFurOU
👉🏼 Telegram: bit.ly/2WwFUop
👉🏼 Playlist: • All about Primes | Com...
Download the Unacademy Learning App here:
👉🏼 Android: unacademy.onel...
👉🏼 iOS: unacademy.onel...
Unacademy Subscription Benefits:
1. Learn from your favorite Educator
2. Dedicated DOUBT sessions
3. One Subscription, Unlimited Access
4. Real-time interaction with Educators
5. You can ask doubts in a live class
6. Limited students
7. Download the videos & watch them offline
#Sieve_of_Eratosthenes #CodeBeyond #Programming # Printing_Prime_Factorisation
Hi @Codeverse , This is bit off topic....I don't see Jay Bansal's Python session happened as scheduled...and Python playlist is gone....are we stopping it...?
thanks bhai
Awesome explanation 🎉🎊
Thanks a lotttt for awesome content👍
I think the create sieve complexity is Nlog(log(sqrt(N))) , if I m not wrong
It is sqrt(N) * log(log(N)) .. since we are running our first loop of i to sqrt(N) times and inner j loop is running in log(log(N)).
@@Anonymous_Coder refer to cp Algorithms
how to find log base 2 n?
GOT IT! thanks bhaiya !..these lectures are addictive!
Amazing lectures till now I understand all the questions.
Thanks a lot for the amazing content.
Understood
Understood.
Make a full series on Competitive programming from beginner to end and Data Structures and algorithms. It's very hard to get good resources for free and not everyone can afford paid courses.
Understood
Understood Striver!
You are a blessing to this community!
Will python course be continued or not
Understood
understood
@codeverse please reply when are we going to see the python course by JAY Bansal sir , don't discontinue🙏
@codeverse please reply when are we going to see the python course by JAY Bansal sir , don't discontinue🙏
Raj bhai ( striver) bohut achhe se samaj aa gaya or saath me confidence bhi aa gya,
Bus sir continuously video banate rahena.
Understood
The method with time complexiy O(sqrt(n)) was better than the last one because the time complexity of the last approach si actually O(N log(logN)) not just O(long)
maza aa gaya
understood
this is amazing...understood everyhtingggg
Understood
Bhaiya please bring next series on Tries, segments trees, fenwick trees and bit manipulations from basic to advance like prime number series. Please 🥺
Understood
Thank You , Understood
These Lectures are damnnn good... everything entered my mind in one go amazing series thanks bhaiya
Understood
Understood
understood
understood
Understood
Understood
understood
Understood it
Understood
samajh aa gaya
ZING ZING AMAZING STRIVER , UNDERSTOOD!!!
Understood
Understoood
understood !! :-) :-)
understood
Understood...!
Understood
@codeverse where are jay Bansal sir's python lectures , don't discontinue it plz it's really informative 🙏
Thankyou so much Striver😁
Understood
understood!!!
I think it is wrong to say every number has prime factorization n. Shouldn't this be explained in more detail?
yeah , u r ryt . infact for a composite number(not prime number) its prime factors are less than equal to sqrt of that number
Amazing Concept.....Understood!
We need that python course back😕
sir kindly tell us some more problems for practice related to the topics thank you
Understood👍
Great job bhai!!
crystal clear!!!!!!!!!!!!
understood baiyaaa
understood
understood
understood
Understood Striver
Understood
understood
Understood , Sir
15:50 q2 see
samajgaya
Understood
Understood
Understood
understood
understood
understood
understood
Understood..
understood
Understood
Ardam avindhi
understood
understood
Understood
Understood
understood
understood
Crystal Clear!
Samjh aaya thank you🥺
Samajh A Gaya😀
understood
such a great video bro understood (god bless you bhai
2:53
Amazing.. Understood Completely !
The whole series is just awesome 😎
It has been a great learning experience for me in CP. Thank you, bhaiya.
Understood...thanks bhaiya
Understood , Thanks
Samajh me aagya and Aisa aaya ki kabhi nhi bhulenge
yes understood,!!
thnku sir
Finest video on Prime Factorization using Sieve!!
Smjh aa gya beat explanation !