Quiz 6

Captura de pantalla 2016-04-07 a las 16.25.17Captura de pantalla 2016-04-07 a las 16.25.47

In this quiz, you needed to create a program which give you de Greatest Common Divisor between 2 numbers that you’ll provide.
This is possible using Euclid’s algorithm.

Just by following the Euclid’s algorithm, you can built the code and it really works.
But one of the thing that I add is, that if the numbers you give to the program are both zero, you will get an ERROR, because 0/0 it’s not defined. So they doesn’t have a GCD.

Here is my GitHub link to my code.

Good luck, and see you around.


Responder

Introduce tus datos o haz clic en un icono para iniciar sesión:

Logo de WordPress.com

Estás comentando usando tu cuenta de WordPress.com. Salir /  Cambiar )

Google photo

Estás comentando usando tu cuenta de Google. Salir /  Cambiar )

Imagen de Twitter

Estás comentando usando tu cuenta de Twitter. Salir /  Cambiar )

Foto de Facebook

Estás comentando usando tu cuenta de Facebook. Salir /  Cambiar )

Conectando a %s