We’re approaching to the end of the course!! And I am finishing up my WSQ tasks. In this post I’m presenting you, my dear reader, the GDCC3000. The GDCC3000 is a code I wrote to calculate the greatest common divisor of two number. I used Euclid’s algorithm. This guy was smart because by using his […]
We’re approaching to the end of the course!! And I am finishing up my WSQ tasks. In this post I’m presenting you, my dear reader, the GDCC3000. The GDCC3000 is a code I wrote to calculate the greatest common divisor of two number. I used Euclid’s algorithm. This guy was smart because by using his […]
In this assignment I had to write a function to calculate the greatest common denominator of two positive integers given by the user using Euclid’s algorithm. I made 3 different versions of the function. On the first one I used iteration, on the second I used a loop based on the successive remainders and the stopping condition […]
Hello, here is my code for this WSQ – Greatest Common Divisor to calculate the greatest common denominator of two positive integers using Euclid’s algorithm. Github: https://github.com/pololarinette/TC-1014/blob/master/%23WSQ12
We are finally in the last part of the semester. How did we get here? Well. This is wsq #12. It was easy for me, the point of it was to create a program that calculates de greatest common divisor of two numbers. I did this with functions. The only thing I had to look for, was the math part of it, because it had to be done with Euclidean algorithm, and I have learned that recursion is not the best option when programming. So, here’s my code: https://github.com/bsolisale/WSQQ/blob/master/WSQ12%20GCD
It was very easy.
Here is my code:
https://github.com/marinaruelas/WSQ/blob/master/wsq12
Hey guys!
This is my code:
https://github.com/JsphSalazar/WSQ-s/blob/master/WSQ12
Thanks to Ken for helped me.
Also I watched this video for more comprehension:
This WSQ was moreless easy, but the difficult part was represent the Euclidian Algorithm in C++ code, but here I am with this WSQ, so for now, see you 🙂
Here my code in github:
https://github.com/MarAnMu13575/-WSQ12-Greates-Common-Divisor/tree/master
And some extra help:
https://www.youtube.com/watch?v=wA6CZIX7UPY
https://www.youtube.com/watch?v=vWFofMZCshw
https://www.youtube.com/watch?v=YRojnL00o8c
Special thanks to Ever Ibarra, his web page:
everibarra101programming.withknown.com
This WSW was a littel tricky because i had to look for the algorith in google. Here is the code working:If you want to see my code in Hithub is on this link:https://github.com/Jocapear/TC1014/blob/master/WSQ12.py
THANKS FOR THE MATH CLASS KEN