Comment Re:That shouldn't surprise anyone (Score 2) 349
I suppose, but I'd rather take my time asking you your knowledge of key libraries and interfaces and more complicated concepts, rather than asking you to code me a sort.
If you really wanted to test someone's rote memorization of the Big O notation values of various algorithms, then just ask them to give you some examples of n or n log n or whatever. You do need to understand the reason that a sort is better than another, and it's nice to have a set of sorts handy for general purpose use, but really, is that what you want to ask about in a limited time?
I usually don't bother. You can look that shit up in books or on the net. More to the point, you should be looking up that shit on the internet if you need to code your own, because there is a decent chance someone has written a better sort or search algorithm for the type of data or structures that you are working with than the ones you memorized in CS 101 for general purpose utilization. You're a developer, not a CS academic researcher. Go to the net, check the benchmarks on some libraries and then get back to coding the actual special sauce of your business.