Prime factorization of a number

[@pratyushpal3311]

Correction.! While writing code... Store the value of n in a separate variable. Because, inside while loop, we are continuosly decreasing it's value and. And once you come out of the while loop and go up in the for loop. The value of "n" Is decremented. So, right thing to do is store value of 'n' in a separate variable. And use it for the 'for' loop. And use the actual 'n' everywhere inside the for loop.

[@sagaralwani75]

you are wrong my friend, look at it correctly, he is right, with all respect I just want to say he is correct, look at the actual mathematics, this is what happens like = 30 = 2*3*5... the first iteration divided by 2, n becomes 15 second time it will be divided by 3 and will become 5 and at last, n will be one and when i is 6, the for-loop condition will be tested as 6 is not less than 1, it won't go inside the loop and yes we are done...

[@yashsalvi5043]

I'm also feeling the same, that the value for sqrt(n) should be a separate variable ! Say we're checking prime factors of 50, then at first i=2; i< √50 , Now we'll go inside of while and then N will be 25, and hence we'll come out of if loop and then the condition inside of for would be like for(i=3; i< √25 ; ....) . Hence, we'll never go to i= 5 !! . That's my POV, I may be wrong though. Can anyone help me out with this ?!

[@mihaisuciu6674]

One of the best programming channel. Great job, i hope and wish that you are going to start posting videos again (I know it s a lot of work behind). Thank you Sir.

[@AdityaSingh-ql9ke]

They cant. It was a 2 man show...and one of the guys died in an accident, He was the best coder in India in his time. SuryaHarshaNarayan aka humble_fool

[@TheSachinAlam]

This is channel is still a gem!!!!

[@xanrd77]

This was exactly what I needed. Thank you!

[@mycodeschool]

Thanks Hasibul !

[@dhariri]

Very nicely explained, but by setting n explicitly inside the while loop you prevent the for loop from continuing to the next i. In the example of 6, the algorithm will return 2^1 instead of 2^1 and 3^1 (because n has been reduced to 2 which breaks the for loops rule that i must be less than n, which is now set as 2).

[@dhariri]

+David Hariri that is for traditional for loops I should say where i < n

[@syedsouban9870]

Yes you are right David, I also observed the fault in the algorithm. The channel does not seem to reply. I guess the correct method should be i

[@MohitSharma-lz1nc]

No, it is correct the last if statement will check that condition.First while will reduce n = 6 to n = 6/2 = 3 and comes out .Second time for loop will terminate as Sqrt(3)

[@003kazimehrabrashid4]

ya, i found nothing wrong with this code.

[@Aniket7Tomar]

in the "worst case" while doesn't play a role and we get O(root n). How can we be sure that in all the other "non worst cases" even though while will be involved we wont get more than O(root n)? i do get it somewhat but not completely tnx

[@sirtejabaskerville]

"while" loop might not play any role but the "for" loop will be running till n. So he reduced it to sqrt(n).

[@enigmaamgine6827]

One of the best channel for code learning

[@sagaralwani75]

6:07 I am fascinated and excited and I am in joy that you are going to answer my question, I am struggling to understand...

[@moonvanestar]

BRO, hablo español, pero en verdad, llevo mucho tiempo buscando un tutorial completo de este tema, para poder mejorar la complejidad en un código, y además de que tu pseudocódigo me ayudo a mejorar el mió, lo explicaste todo muy bien!, en verdad muchas gracias, tienes un nuevo suscriptor

[@ahmadahmadi8398]

thanks sir, very nice lessons ... those how want really improve thier skills will be amazed by ur vedios ... thanks but sir add up some more videos on algorithems and Java language... thanks I am also B.Sc student thanks...

[@cesarjom]

correction at 9:14 ? i does NOT become greater than n (n=44) at i =12, the condition to exit loop. Rather I think the presenter meant to say i becomes greater than n / 2, which is also valid reason to exit for-loop.

[@verynicehuman]

i does become greater than n. i would be 12 and n would be 1 so obviously 12>1. The mistake you made is in the for loop. for(i=2;i

[@shubhamAgrawal21]

very nicely explained sir,but i didn't get how in the worst case the inner while loop will execute only once...

[@ajoydev8876]

but, I have little bit a confusion that, first for(int i = 2; i

[@doingsneakypeakylike]

This channel is gold! Thank you.

[@ravikhatri24]

Was gold, he died in a car accident

[@adityashidlyali7814]

@@ravikhatri24 is it true? Bro?

[@unknownman1]

@@ravikhatri24 *Idiot* , not this guy, but the co-founder of this channel died in a car accident. The voice of the guy which we hear in all videos is still alive and is working at Google.

[@kushalava007]

thank you so much. Excellent explanation

[@adityamore2616]

first time I am interested in algorithms because of you, thanks.🙏

[@akashbhadouria6727]

He's no more

[@adityamore2616]

@@akashbhadouria6727 what no more?

[@akashbhadouria6727]

@@adityamore2616 He died ⚰in a road accident. This is what I heard and read comments on his videos. He's dead!

[@adityamore2616]

@@akashbhadouria6727 okay, RIP a good person⚰

[@indiansoftwareengineer4899]

​@@akashbhadouria6727 Oh bro, very bad, seriously feeling bad for him. RIP, I used to watch his channel in first/second year of university, before 4-5 years, when there were no more coding channels for algorithms.............

[@Nick-oe1dq]

Hello, can someone type the coding on the left I'm finding it a bit confusing

[@lomeshdaheria9960]

Thank you 😊😊😊 for the wonderful explanation

[@aziz9488]

Thanks sir but I believe that if n is prime the while loop won't execute except if i=n it will run once, is this true ?

[@siddharthasharma5900]

you are right.

[@devendrakumar6240]

but the last if statement will print the prime no.(n)

[@AdrianFI]

thankyou very much i understand this very clearly

[@kalyanitewari]

Thank you so very much sir, really helped a lot.

[@surajpatel2308]

who else is watching in 2020.

[@avulalakshmidevi9807]

Thanks for explain this lesson

[@shahariarkabir210]

nice explanation

[@BenjiBoyOfficial]

Great video !

[@dontony7071]

Got it bro.Thanks

[@whereismycheese2089]

your primeFactorization function stops when i is 6 (n is given as 44).. correct?

[@ashish3944]

i think it would stop before 6....at 4...since inside the value of n is being changed by the statement n/=i; so it would affect the for loop condition.

[@nikhilraj6268]

@@ashish3944 I will not go till 4 , it will remain at 2 and finally get 2*2*11

[@decodingmathematics9957]

@@nikhilraj6268 when i=2 exits, n would have become 11 , it will change sqrt(n) to 3, loop enters for i=3 , not divisible , now the loop breaks when i=4

[@bipul2138]

nice one sir

[@janvimyadventures1310]

Everyone like regional language Hindi our mother tongue But an Indian coder needs to speak English many people will be helped .

[@belgacembenamira2779]

Thank you

[@ShivamVerma-gq2sm]

Thankyou !

[@alyaaahmed4462]

thanks soooooooooooooooooooo much

[@hemelkhan1]

very nice

[@yashasgowda1361]

Me watching one day before my board practical exam

[@pranjalgoyal6747]

What a great man So sad that he died so early. Otherwise he would have been a great teacher

[@AtulSingh-xt7zb]

I think the one in this video is not Harsh, he is Animesh. Anyway, this has to be one of the best channels on programming so far.

[@fredrickarichards8548]

ok

[@manojeet_das]

what about no. 26? square root of 26 is about 5.1 , so the value of i will never reach 13 so, it will only print 2

[@suprithnarayan9894]

last if statement take care of that.

[@SumitKumar-wu4cj]

manojeet gawar ...

[@SumitKumar-wu4cj]

manojeet you are my tatti

[@abdullahshahid7172]

bad