euclid's algorithm for gcd

[@avinashchaudhary4231]

I have watched even MIT lectures but yours are best. First time something clicked in the mind. I understood how to optimize algo

[@gauravrai5784]

Same here😉

[@adityamehra7238]

Cs50?

[@avinashchaudhary4231]

@@adityamehra7238 yes

[@tavilefty]

@@avinashchaudhary4231 NW bro, u cappin

[@gatepreparation645]

Same

[@priyankaruby]

omg this guy is super Genius !!! I never seen such a great teaching in my life ! thank you so much Madhavan

[@tavilefty]

he's your papa's age.

[@iyodajedi]

Beautiful Explanation. Kudos to you to explain this interesting algorithm and kudos to Euclid for discovering(? or inventing😁) this algorithm...😃

[@nirmalrajtb3586]

@5.07 return(gcd(max(n,diff),min(n,diff))) is correct

[@rimjhimgoenka5351]

Why do we have to write gcd(max(n,diff),min(n,diff)) if the gcd function has the if statement to interchange if m

[@naveen.kumawat]

listen carefully at 8:10.

[@animeshbansal9214]

Yes it is not required

[@TusharGupta1991]

it’ll help with the first iteration.

[@rohanthomas5434]

It's redundant, great observation.

[@The_vaishnav]

dimmag khol diva ...one problem many solutions ....life lesson 🙂🙂🙂

[@hb_shyampur]

In case helpful. m=qn+r 15=2*6+3 ad=q(bd)+r 5*3=2*(2*3)+3 d divides r.

[@abhishekmazumdar2072]

wow..just wow!! simply wow.

[@sruthir1236]

Why we have to manually change the input values as gcd(big_no,small_no) ?? Will it give wrong solution if we give the input as it is like gcd(small_no,big_no) ??

[@luciferdelhi4352]

sir at the 15:00 slide are we missing an if loop before the starting of while loop??

[@deepakdhaka.]

no

[@Jaimin_Bariya]

Jp here again [comment number 50] Thank you, sir, :)

[@srikanthkarunakaran1699]

Thank you very much sir, you are the best in teaching!

[@shubhankarsharma2221]

teacher took complicated topic and explained it with very low volume

[@sahilkumarsingh]

Only 1 and 2 are coming as the GCD for every input ???? How

[@irivintishivateja9507]

gcd(8,12) ... 12%8 = 4....gcd(8,4)...8%4 = 0....return(4)

[@myArchive1117]

sir why are we using +1 in 'for' loop?

[@aloksinghrawat9832]

Because in python loop occurs for 1 less than the max. limit. So to neutralize it we increase the limit by 1.

[@sivasatyanarayana9748]

sir the video sound was very less

[@pk15692]

You can use a volume booster for chrome to enhance the sound volume

[@tavilefty]

@@pk15692 thanks man.

[@kevindave277]

Merci Madavan

[@vaibhavsingh8485]

Why was I told the difference algo.

[@girishgarg2816]

Same here

[@RuchiSingh-om7cz]

Here last gcd will be gcd(1,2) i guess

[@siddahantjain755]

No ruchi singh because of the condition (m,n)=(n,m) it will be (2,1) rather than (1,2)

[@manishrajput8109]

what is a mrcf ?????

[@ritwiksinha7432]

Most Recent Common Factor

[@prashantajabe2693]

Variable

[@myArchive1117]

yeah its a variable which will be updated by most recent common factor in each iteration

[@srinivasanthirunavukkarasu4499]

Feel like odd one out here Why hooked up with GCD for three lecture

[@pasumarthiashik1099]

why if condition and assume in comments different.

[@lucygaming9726]

Great.

[@shweethasajeev7048]

sir the volume is really low

[@pk15692]

You can use a volume booster for chrome to enhance the sound volume

[@RamKumar-wq2us]

download it then play it in vlc player

[@gauravarora8405]

awesome

[@NMD137307]

Good lec, thanks.

[@sanjayguptacg486]

bad sound quality

[@pk15692]

You can use a volume booster for chrome to enhance the sound volume