Viewing profile — feliperibeiro

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. :)

You're right. This is the subtraction-based implementation, the division-based is the original and better one :) https://github.com/felipernb/algorithms.js/commit/e5a04f9ad0...

Exactly! Also, many JS devs are clueless about CS101 basic things, it's a way to maybe make them a bit interested. From the wiki ( https://github.com/felipernb/algorithms.js/wiki )…

Still this is an issue with the algorithm, not the implementation. http://en.wikipedia.org/wiki/Euclidean_algorithm

This is the Euclidean algorithm for GCD, it's naive and simple. But if you see it more carefully, the commit that says "Optimized performance ..." contains just the lines: 34 var t…

This is a complicated issue, but in my opinion the google/facebook style of interview is the one that gives you less false positives, even though it gives tons of false negatives. …