(42S) GCD
|
02-13-2018, 09:57 PM
(This post was last modified: 02-13-2018 10:00 PM by Logan.)
Post: #7
|
|||
|
|||
RE: (42S) GCD
(07-12-2016 06:23 AM)Dieter Wrote: Also posted in the other GCD thread: I tried to come up with my own method to do this (after reading about Euclid's Algorithm), and once I had did a search to see what others had come up with. I was proud to see that the one I'd come up with was identical to this with the exception that I swapped X<>Y at the end instead of the addition. |
|||
« Next Oldest | Next Newest »
|
Messages In This Thread |
(42S) GCD - Eddie W. Shore - 07-10-2016, 01:39 AM
RE: (42) GCD - Joe Horn - 07-12-2016, 03:48 AM
RE: (42) GCD - Dieter - 07-12-2016, 06:23 AM
RE: (42S) GCD - Logan - 02-13-2018 09:57 PM
RE: (42) GCD - Paul Dale - 07-12-2016, 06:40 AM
RE: (42) GCD - Dieter - 07-13-2016, 09:59 AM
RE: (42S) GCD - Csaba Tizedes - 08-17-2017, 02:23 PM
|
User(s) browsing this thread: 1 Guest(s)