Comment Re:Probably not. (Score 1) 546
As another example, understanding half a dozen sort algorithms is pointless. If you're writing your own sort function, you're doing it wrong. Just call the one in the API.
Understanding those algorithms is still important, though, even if you're just using the available APIs. I know that depending on what framework I pick, the API's sort function will either be an implementation of quicksort, quicksort with an optimization to prevent worst case performance on presorted data, mergesort or (rarely) a handful of others. In many cases it is important to know which one is being used. Is resorting an already sorted list going to give me poor performance? Will elements that compare equal be maintained in order or would they be psuedorandomly transposed? If I know the details of common sorting algorithms I can tell this at a glance, and can easily remember which applies to which framework. If I don't know the details, I'll have to dig into documentation (or, quite frequently, stack overflow questions) to find the answers, which will take much longer.
And the other thing that CS teaches is that there are alternative approaches: why are you using a sort function, when you could be keeping your data in a tree structure instead?