L6. Sieve of Eratosthenes | Maths Playlist

[@pmanideep39]

Your explanation is much better than Leetcode editorial

[@keshavbadhekar]

Sieve of Era&%#.... something like that🤣🤣🤣
Nice Solution👍
Understood

[@slayer-x2f]

I think that was publicity move 😜

[@trailblazer555]

Understood; I'm improving my thought process in every video; Thank you bro;

[@ChannelBCD]

Bro explained it smooth like butter

[@AdityaSingh-uy8ms]

UNDERSTOOD every bit ..... Thank u soo much !!

[@nptel1punith929]

if your video doesn't exist for a concept, well it sure that we are going to have hell a lot of trouble in getting the intuition

[@stith_pragya]

Understood........Thank You So Much for this wonderful video.............🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻

[@MO-fg2cm]

inner loop can be started from i*i

[@piyushchauhan2898]

just want to say that : Pdh ke Mza aa gya

[@taqimustafa7665]

Arrays.fill(prime,1) in java

[@vedikamishra009]

wow

[@AkOp-bf9vm]

IF WE INITIALISE VECTOR LIKE { vector arr(n+1,1)} DOES IT STILL CONSIDERED AS O(N) TIME???

[@kshitijjha6737]

Yes as it is not exact time taken.. It is just an asymptotic notation of time taken, an assumption of how fast the code will run.

[@siddiqabr7110]

The thing is you don't have to you can just think of 0 as primes and mark 1 for non primes

[@Satyam-je4tb]

With memset, however, the values are not set to the integer 1; they are set to a non-zero integer (16843009), which is not correct for this algorithm.

[@AshishSingh-he2qo]

Wonderful explanation ❤❤

[@jivrajsinghshekhawat]

Thanks brother, you have got very nice teaching skills

[@KeerthiReddyKolan]

Instead of filling the arrays with one and then changing them to zeros, isn't it better to use the default zero and change it to 1 accordingly?

[@valagautam727]

It is not going to change anything.
By default all elements of array are not zero some of them are zero and some of them are one or garbage so we have to fill all the elements with zero which is same .

[@NishikantDounekar]

Sir I visited your website after Harkirat sir's webinar, But I can't able to singup in takeuforward website also no content showing loading AToZ - DSA page, why is it sir, help me out

[@Therealtalk123]

Nice effort sir.. 👌 😊

[@codeman3828]

Great explanation. Understood

[@saicharanthammi143]

Excellent explanation sir

[@AkashDas-ze2co]

Here the space complexity is O(n) but we can reduce it to O(n/2) by ignoring the even numbers as all the even numbers are multiple of 2. So we can ignore them.

[@FutFreaKKKKK]

n/2 is still n

[@AkashDas-ze2co]

Yeah my bad. ..I forgot about that... constants are ignored and still O(n) ​@@FutFreaKKKKK

[@sanchitsanyam7359]

Striver Sir , i am your Jabra fan

[@ipshitatandon5134]

Such a nice method!

[@RamyaSreevarshini]

Thank u so much ✨

[@prasadm3614]

Your work load added eye shades

[@vipuljamod4119]

Waiting for string playlist...,

[@28deekshitha.b78]

Why the array has taken n+1

[@Kumaar_Ritesh]

For n = 31, we get an indexing till 30 right ? So, while printing the indices we have elements till 30 and not 29, that has been done. Hope it's clear now.

[@codevibez2023]

When it will be complete?? I am confused to start . I am thinking to start this series but when it will completely end of this batch

[@codeman3828]

Hey i know i am late but just an advice. Start with the A-Z sheet as soon as possible without waiting for it to be finished. Striver has left only 4-5 topics but rest 13-14 are there with detailed explanation. If you are in college trust me you will never get this time back again. It will be very hard to study DSA along with job. I am working professional and it is very difficult to study when you are tired because of work and only have weekends to study long. So fight your procrastination and start studying. All the best

[@codevibez2023]

@@codeman3828 thank you for your kind advice..

[@AyushMishra-b8w]

@@codeman3828 Really appreciative

[@IBMX65]

12:30

[@reddygopichand2002]

Understood ❤

[@vedikamishra009]

11:16

[@oyeshxrme]

thanks bhaiya

[@Gottastudyhard-m3b]

Can you please bring a video on How to actually derive the time complexity based on maths, that'll be more helpful.

[@jayant9416]

already have a vdo on his channel

[@hashcodez757]

just watch his lectures and in each one he explains in depth....aise hi seekh jaoge bhot kch.....same as me

[@adityabirdy8996]

Sir i have just started a2z how much time should it take to complete

[@ravindrarangwani102]

It would take around 3-4 months
If you study 4 hours daily

[@SibiRanganathL]

Undestood 😺

[@MICHAELMURITHI-y7y]

Thanks man

[@devangagarwal954]

Where is thecode

[@tharungr7701]

understand sieve of eras thaas theens :)

[@sainathpatil2674]

if n is as big as 10^7 it will give TLE

[@therandomguy21]

nahh it will not

[@drishtirai864]

Understood :))

[@2amCoder]

nice !

[@tej.askamble]

31/05 Revise

[@abhinanda7049]

understood

[@yashkalia2311]

Great

[@Shivi32590]

thank you

[@Satyam-je4tb]

With memset, however, the values are not set to the integer 1; they are set to a non-zero integer (16843009), which is not correct for this algorithm.

[@prabhakaran5542]

Understood ❤

[@chiragbansod8252]

understood

[@anshgupta8860]

understood

[@hardikpatel352]

understood

[@shaiksoofi3741]

understood

[@shashankvashishtha4454]

understood