Euclids algorithm GCF intuitively explained w python code
>> YOUR LINK HERE: ___ http://youtube.com/watch?v=fqNh-A4ev3s
This video gives a logical explanation to the Euclid's algorithm to find the GCF. A simple illustration is used to intuitively explain the algorithm. The code for the same is written and explained in Python. • Note: • A small mistake at 8:51 its supposed to be “12 takes 3 blocks of 4, where 2 blocks make up the number 8 while the other block is used to fill the remainder of 4” Even in the illustration there are only supposed to be 3 blocks of 4. • Time stamps: • 0:00 Prime factorization method • 1:37 Iterative approach • 2:39 Euclid's algorithm • 9:50 Python code
#############################
