https://github.com/estebanpinal/WSQ/blob/master/WSQ12
It wasnt that difficult after doing a research of the Euclids algorithm http://www.cut-the-knot.org/blue/Euclid.shtml here is my code https://github.com/fernandazm/WSQS/blob/master/WSQ%2012
was really easy
here is the link to my code:
https://github.com/cortesivan96/WSQs/blob/master/Greatest%20Common%20Divisor%20(WSQ12)
Here’s WSQ 12, I made it in class with Ken. Here’s the working program Here’s the source code and my GitHub repository.
(The credit of the image goes to https://flic.kr/p/dT5aU3) I haven’t done WSQ’s for a while because I’ve been so busy with school, sorry. But now, we’re getting to the end of the semester and, well, I have to finish all the wsq’s. For my luck, this one was an easy task!!! Here’s the code: https://github.com/anagloriaac/WSQ/blob/master/WSQ12%20-%20Greatest%20Common%20Divisor
In this WSQ I had to write a code in which I could use the already known Euclids Algorithm to find the Greatest Common Divisior of two numbers that will be asked to the user. Euclids Algorithm: The Euclidean algorithm… Continue Reading →
Wasn’t really hard to get through this one, It was mainly applying single operations between to numbers. here’s the code: https://github.com/A01154027/TC101/blob/master/WSQ12.cpp
GCD(36,24)= 12
This WSQ was easier than I thought.You can check out my code here.
Here is my code for the WSQ12
https://github.com/dianagdv/TC101/blob/master/WSQ12
Blog post for WSQ12 which is Greatest Common Divisor or gcd for short. What i do here is, ask the user for 2 values, declare a function, and then use a loop which then changes the value of “x” to “y” and “y” to the remainder of the division from “x” and “y”, while “y” […]