Warning: The magic method Slickr_Flickr_Plugin::__wakeup() must have public visibility in /home/kenbauer/public_kenscourses/tc101fall2015/wp-content/plugins/slickr-flickr/classes/class-plugin.php on line 152
‘#wsq12’ Articles at TC101 Fall 2015
Introduction to Programming Python and C++

# WSQ12 – Greatest Common Divisor

Here you can find my code for WSQ12:
https://github.com/finntec/wsq12.git

# WSQ12

Para este WSQ sólo vi un video en youtube sobre el algoritmo de Euclid y lo demás lo deduje por lógica. Aquí está el código. El operador % ayudó bastante para simplificar la función. //WSQ12 #include <iostream> using namespace std; int gcd (int x, int y){ int yy; int xx; int z=1; while(z!=0){ xx=x; yy=y; […]

# WSQ12

This is a program that calculates the greatest common denominator of two positive integers using Euclid’s algorithm. https://github.com/DianaJU/Write/blob/master/gcd.py

# WSQ12 – Greatest Common Divisor

Fairly simple and short. Here’s the code: https://github.com/Dragv/wsq12/tree/master

# WSQ12

https://github.com/FernyAlanis/wsq11-17/blob/master/wsq12

# #WSQ12

Foto: https://flic.kr/p/sUJ9TM Estaba fácil y no tuve ningún problema en hacerlo. Aquí esta el link de mi código: https://github.com/BrayanGc/Codigos/blob/master/GCD.cpp

# #WSQ12

This one was really easy.

# #WSQ12 GCD

This task was quite easy, it was possible to do only reading about Euclid’s algorithm. Even in wikipedia. It was just taking both numbers and getting its module, then dividing the second number and the module, until the module was 0…. Continue Reading →

#### What should you work on?

Week #12 and more partial exams for you.