Viewing profile — virgi1

Nope. Not GPL-licensed.

Yes you are. It's O(nlogn) where n is 5 - i.e. it's constant time (you can easily find the median by 4 comparisons to find the smallest of the 5, followed by 3 comparisons for the …

No it's not. Good design is about solving a problem, and you can't do that without understanding the problem. Just like you (and me! because I'm a compiler programmer, at heart) ca…

This. I can't believe nobody else pointed out that it's not n-squared. (but, lots of people pointed out that complexity is really about reasoning not about memorisation - and you h…