Here’s my code, maybe it’s ugly but it works 😉 GitHub code: https://github.com/luisduartepalacios/WSQ12/blob/master/WSQ12.cpp
I’ve had my mind focused in tons of things at the same time, but I finally made some time to continue with WSQ’s. I took me about 15 minutes to get this one done, it was really easy. Mostly, I just took time reading about Euclid’s Algorithm, but once I fully understood it everything turned […]
Hi there, here is my wsq12, this time the task was to create a program that would calculate the GCD (Greatest Common Divisor) of two values given by the user, it wasnt that difficult, so I hope my code helps you! n_n. Code on Github: https://github.com/samanthariverac/TC101/blob/master/%23wsq12
I could write the code with the help of this video and page, it wasn’t so difficult… http://www.foro.lospillaos.es/algoritmo-de-euclides-recursivo-vt11817.html https://www.youtube.com/watch?v=FYpoe0edKFg And here it is my code! https://github.com/Andreandc/TC1017/blob/master/WSQ12
In this WSQ we calculated the gcd of two numbers using the Euclid’s algorithm in a function. In the main …
It is about founding the greatest common divisor. What I did first was wrong because you have to make sure that the give you the biggest number first, and whith the loop I did it was keeping throwing me zero….. here si my fist code After doing the corrections and use de if conditionals this… Read More WSQ12
Hey this is #WSQ12 about the greatest common divisor. It took a while to understand the Euclid´s algorithm so somehow, with a little research, I did it. Here is my code in github https://github.com/ricardonewton/TC101/blob/master/GCD
Greatest Common Divisor This WSQ was easy, I only had to read about the Euclid’s algorithm to understand a little bit how I had to do it. I read about Euclid’s algorithm in this website: https://en.wikipedia.org/wiki/Euclidean_algorithm Picture taken from: https://en.wikipedia.org/wiki/Euclidean_algorithm And here my code uploaded on github: https://github.com/manuelgodm/TC101/blob/master/GreatestCommonDivisor.cpp
I skipped the WSQ 11 because I don’t know yet how to do it. With a quick research I realice that this WSQ was easy with the proper knowledge, of course. http://codereview.stackexchange.com/questions/66711/greatest-common-divisor Here is where I got the dea of… Continue Reading →
The semester is almost done, and so the WSQ’s for this semester. I´m so excited: The image: The code: https://github.com/hrglez/TC1017/blob/master/WSQ12%20-%20GCD See ya! Good luck for everyone.