Algorithms.js – Atwood's Law applied to CS101

Re:Algorithms.js – Atwood's Law applied to CS101 by shoki on Friday May 30, 2014 @09:16AM (#7821552)

There are a couple of GCD algorithms that have better asymptotic performance than Euclid's (an old one is due to Knuth): http://www.ams.org/journals/mcom/2008-77-261/S0025-5718-07-0...

I'm surprised the author didn't implement the binary gcd, however, although it has the same big-O as Euclid: https://en.wikipedia.org/wiki/Binary_GCD_algorithm

[ Parent | on HN ]

Re:Algorithms.js – Atwood's Law applied to CS101 by feliperibeiro on Friday May 30, 2014 @09:30AM (#7821624)

I've been doing this sporadically and in my free time, just for fun, so there are a lot of fundamental things that haven't been covered there. :)

[ Parent | on HN ]

Re:Algorithms.js – Atwood's Law applied to CS101 by shoki on Friday May 30, 2014 @10:12AM (#7821875)

I do this sort of thing sporadically in my free time too... it's still good to go back and do stuff smarter when you learn better rather than accepting whatever they taught you in CS101 as the end of the story.

[ Parent | on HN ]