{"id":1468,"date":"2016-02-03T08:40:11","date_gmt":"2016-02-03T14:40:11","guid":{"rendered":"http:\/\/kenscourses.com\/tc201winter2016\/?p=1468"},"modified":"2016-02-03T08:40:11","modified_gmt":"2016-02-03T14:40:11","slug":"wsq06-greatest-common-divisor","status":"publish","type":"post","link":"https:\/\/kenscourses.com\/tc201winter2016\/2016\/02\/wsq06-greatest-common-divisor\/","title":{"rendered":"WSQ06 – Greatest Common Divisor"},"content":{"rendered":"

Java Programming<\/h2>\n

Okay, a simple one to start and many of you already did this in Python. The trick here should be to implement this with message calls, not a simple iterative solution. You should be asking the number, “hey, what is the greatest common divisor you have in common with this one I am passing you as a parameter?”<\/p>\n

Background<\/h2>\n
\"creative<\/a>
creative commons licensed (BY-NC-SA) flickr photo by the past tends to disappear: http:\/\/flickr.com\/photos\/daniandgeorge\/11906109865<\/figcaption><\/figure>\n

In this assignment you will write a program\u00a0to calculate the greatest common denominator of two positive integers using Euclid’s algorithm.<\/p>\n

<\/h2>\n

<\/h2>\n

<\/h2>\n

<\/h2>\n

<\/h2>\n

What to Do<\/h2>\n

Okay, a simple one to start and many of you already did this in Python, now to do this in Java with objects. The trick here should be to implement this with message calls, not a simple iterative solution. You should be asking the number, “hey, what is the greatest common divisor you have in common with this one I am passing you as a parameter?”<\/p>\n

What to Submit<\/h2>\n

As usual, create a blog post explaining what you did, where you found resources (books, videos, web pages, friends) to help you solve this. Remember to put the tag #WSQ06 on your post so our blog hub picks that up.<\/p>\n

You should include your code as a link to GitHub.<\/p>\n

And of course, leave any questions here as well as asking those questions on Twitter with the hashtag #TC201 so we all see your question posted there.<\/p>\n","protected":false},"excerpt":{"rendered":"

Java Programming Okay, a simple one to start and many of you already did this in Python. The trick here should be to implement this with message calls, not a simple iterative solution. You should be asking the number, “hey, what is the greatest common divisor you have in common with this one I am … Continue reading WSQ06 – Greatest Common Divisor<\/span><\/a><\/p>\n","protected":false},"author":2,"featured_media":19226,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[18,60],"tags":[],"class_list":["post-1468","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-instructor","category-wsqs"],"_links":{"self":[{"href":"https:\/\/kenscourses.com\/tc201winter2016\/wp-json\/wp\/v2\/posts\/1468","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/kenscourses.com\/tc201winter2016\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/kenscourses.com\/tc201winter2016\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/kenscourses.com\/tc201winter2016\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/kenscourses.com\/tc201winter2016\/wp-json\/wp\/v2\/comments?post=1468"}],"version-history":[{"count":2,"href":"https:\/\/kenscourses.com\/tc201winter2016\/wp-json\/wp\/v2\/posts\/1468\/revisions"}],"predecessor-version":[{"id":1470,"href":"https:\/\/kenscourses.com\/tc201winter2016\/wp-json\/wp\/v2\/posts\/1468\/revisions\/1470"}],"wp:attachment":[{"href":"https:\/\/kenscourses.com\/tc201winter2016\/wp-json\/wp\/v2\/media?parent=1468"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/kenscourses.com\/tc201winter2016\/wp-json\/wp\/v2\/categories?post=1468"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/kenscourses.com\/tc201winter2016\/wp-json\/wp\/v2\/tags?post=1468"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}