Algorithms } 036 } Greatest Common Divisor (GCD) }

This lecture discusses Euclid’s algorithm for finding greatest common divisor. Extended Euclid’s algorithm has also been discussed.

[ ►Subscribe ] Leprofesseur } on YouTube. We appreciate your feedback and support. Do not forget to give thumbs-up 🙂


2,511 total views, 4 views today

Leave a Reply

Your email address will not be published. Required fields are marked *

Knowledge at your fingertips } Rethink the way you learn }™     Leprofesseur }


Skip to toolbar