Warning: The magic method Slickr_Flickr_Plugin::__wakeup() must have public visibility in /home/kenbauer/public_kenscourses/tc101winter2015/wp-content/plugins/slickr-flickr/classes/class-plugin.php on line 152

Warning: Cannot modify header information - headers already sent by (output started at /home/kenbauer/public_kenscourses/tc101winter2015/wp-content/plugins/slickr-flickr/classes/class-plugin.php:152) in /home/kenbauer/public_kenscourses/tc101winter2015/wp-includes/feed-rss2.php on line 8
‘#GCD’ Articles at Courses by Ken https://kenscourses.com/tc101winter2015 Facilitator of Learning Experiences Fri, 10 Apr 2015 02:21:24 +0000 en hourly 1 https://creativecommons.org/licenses/by/4.0/ #WSQ12 https://kenscourses.com/tc101winter2015/2015/wsq12-20/ Fri, 10 Apr 2015 02:21:24 +0000 https://taniapardo.withknown.com/2015/wsq12 Continue reading →]]>

For this program I had to calculate the greatest common divisor of two possitive integers, to do this we implemented Euclidean Algorithm, if you want to know more about this you can check this link: http://es.wikipedia.org/wiki/Algoritmo_de_Euclides

I think that this program is really simple, because you only need to evaluate each case and apply the formula.

For this program I think that is useful to know something about functions, because you can implement them and have a program more organized.

Here you can see my code and the program working.

Also you can find my code here:

GitHub: https://github.com/taniaprogram/SolvingProblemsWithProgramming/blob/master/gcd.cpp

Google Drive: https://drive.google.com/file/d/0B-NM4ghaDXBvYk1MT2dwWGhKQXc/view?usp=sharing

]]> https://creativecommons.org/licenses/by/4.0/