virgi1

4 ms·

1. 1.▲
   by virgi1 13y ago

   Nope. Not GPL-licensed.
2. 2.▲
   by virgi1 13y ago

   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 2nd smallest, followed by 2 comparisons for the me
3. 3.▲
   by virgi1 13y ago

   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) can't really solve a problem we don't
4. 4.▲
   by virgi1 13y ago

   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 have to be good at reasoning in order to be a good programme