
I was hoping the article will address this question. Finding which sorting algorithm is good for what type of data can be done in a catalog fashion: list an agorithm against an input sizes/type/etc.
What i was hoping to hear was that when learning sorting/searching algorithms, it is esential to learn the internals most because the sorting algorithms have properties beyond sorting alone. Thus in a particular problem one may be interested in how some sortingalgorithminternalvariable changes for example, and that wont be got by calling a sort() routine. We should not be interested in mere sorting alone but in the properties of the variable involved. This sounds almost like the goal of doing pure mathematics.Ever wondered why someone may be concerned with the distribution of prime numbers? Distribution of primes is not the goal they are after.They are interested in the system of logically related theorems that pop out while trying to solve the problem.I guess the study of sorting algorithms has the same goal besides mere sorting. 