2.4. GCD of Two Number | Data Structures and Algorithms | Python | DSA Series

Hello Guys,
In this video, We are solving GCD of Two Numbers.

***********************************
Try It Yourself first...
***********************************

Contents and Timeline for the video:
🕒 00:00 - Intro
🕒 00:15 - Naïve GCD Calculation
🕒 06:07 - Code for Naïve GCD Calculation
🕒 06:46 - Why not single scan from 1 to max(m, n)?
🕒 07:57 - Even Better?
🕒 09:04 - Do we even need list at all?
🕒 09:49 - Scan Backwards
🕒 11:54 - Euclid's Algorithm for GCD Calculation
🕒 13:05 - Code for Euclid's Algorithm for GCD Calculation
🕒 15:35 - Optimized Euclid's Algorithm for GCD Calculation
🕒 17:14 - Code for Optimized Euclid's Algorithm for GCD Calculation
🕒 18:13 - Outro

Hey,
Do Like and Share the video, and Subscribe to the Channel...

In Next Video, going to discuss, Solution for GCD of Two Number...

Until Then,
Sayonara!!!

Let's Connect: (can also send doubts on)