GCD Algorithms (Part 2): Extended Euclidean Algorithm | CodeChef Tutorials

This video covers the concept of GCD, focusing on the Extended Euclidean Algorithm and its applications. Learn about the Euclidean GCD algorithm and how it can be used to find the greatest common divisor efficiently.

GCD Algorithms (Part 2): Extended Euclidean Algorithm | CodeChef Tutorials
Learn to Code with CodeChef
8.0K views • Aug 6, 2021
GCD Algorithms (Part 2): Extended Euclidean Algorithm | CodeChef Tutorials

About this video

In this video will discuss GCD and one most common GCD algorithm - Euclid's GCD algorithm and its applications. Greatest Common Divisor or GCD algorithm is used to compute the GCD of two integers. Euclid's GCD algorithm reduces fractions, RSA crypto, computing the LCM, and much more.

Learn problem solving using this roadmap
https://www.codechef.com/roadmap/cpp-dsa?utm_source=youtube&utm_medium=video&utm_campaign=youtube_previous

Master DSA following this roadmap:
https://www.codechef.com/roadmap/data-structures-and-algorithms?utm_source=youtube&utm_medium=video&utm_campaign=youtube_previous

▶️Do Like 👍, comment & share the the Video with your friends & subscribe our CodeChef YouTube Channel and press the 🔔 bell icon to get notifications for all new video editorials of all your favourite CodeChef problems..

🔵Reach out to us on any of our social media handles:
🔸Instagram: https://www.instagram.com/codechef
🔸LinkedIn: https://www.linkedin.com/company/codechef
#Coding #Competitive_Programming #Codechef

Tags and Topics

Browse our collection to discover more content in these categories.

Video Information

Views

8.0K

Likes

205

Duration

10:58

Published

Aug 6, 2021

User Reviews

4.6
(1)
Rate:

Related Trending Topics

LIVE TRENDS

Related trending topics. Click any trend to explore more videos.

Trending Now