euclid's algorithm for gcd
Вставка
- Опубліковано 26 вер 2017
- To access the translated content:
1. The translated content of this course is available in regional languages. For details please visit nptel.ac.in/translation
The video course content can be accessed in the form of regional language text transcripts, books which can be accessed under downloads of each course, subtitles in the video and Video Text Track below the video.
Your feedback is highly appreciated. Kindly fill this form forms.gle/XFZhSnHsCLML2LXA6
2. Regional language subtitles available for this course
To watch the subtitles in regional languages:
1. Click on the lecture under Course Details.
2. Play the video.
3. Now click on the Settings icon and a list of features will display
4. From that select the option Subtitles/CC.
5. Now select the Language from the available languages to read the subtitle in the regional language.
I have watched even MIT lectures but yours are best. First time something clicked in the mind. I understood how to optimize algo
Same here😉
Cs50?
@@adityamehra7238 yes
@@avinashchaudhary4231 NW bro, u cappin
Same
omg this guy is super Genius !!! I never seen such a great teaching in my life ! thank you so much Madhavan
he's your papa's age.
Beautiful Explanation. Kudos to you to explain this interesting algorithm and kudos to Euclid for discovering(? or inventing😁) this algorithm...😃
@5.07 return(gcd(max(n,diff),min(n,diff))) is correct
wow..just wow!! simply wow.
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) ??
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
listen carefully at 8:10.
Yes it is not required
it’ll help with the first iteration.
It's redundant, great observation.
dimmag khol diva ...one problem many solutions ....life lesson 🙂🙂🙂
Great.
awesome
sir at the 15:00 slide are we missing an if loop before the starting of while loop??
no
In case helpful.
m=qn+r
15=2*6+3
ad=q(bd)+r
5*3=2*(2*3)+3
d divides r.
Thank you very much sir, you are the best in teaching!
teacher took complicated topic and explained it with very low volume
Merci Madavan
Only 1 and 2 are coming as the GCD for every input ???? How
gcd(8,12) ... 12%8 = 4....gcd(8,4)...8%4 = 0....return(4)
sir why are we using +1 in 'for' loop?
Because in python loop occurs for 1 less than the max. limit.
So to neutralize it we increase the limit by 1.
sir the video sound was very less
You can use a volume booster for chrome to enhance the sound volume
@@pk15692 thanks man.
Here last gcd will be gcd(1,2) i guess
No ruchi singh because of the condition (m,n)=(n,m)
it will be (2,1) rather than (1,2)
Feel like odd one out here
Why hooked up with GCD for three lecture
Good lec, thanks.
Why was I told the difference algo.
Same here
sir the volume is really low
You can use a volume booster for chrome to enhance the sound volume
download it then play it in vlc player
what is a mrcf ?????
Most Recent Common Factor
Variable
yeah its a variable which will be updated by most recent common factor in each iteration
why if condition and assume in comments different.
bad sound quality
You can use a volume booster for chrome to enhance the sound volume