JOIN
 Revision History
 Select a Forum     Round Tables New Member Discussions News Discussions Algorithm Matches Marathon Matches NASA Tournament Lab TopCoder Cookbook High School Matches Sponsor Discussions Development Forums Design Forums Search My Post History  |  My Watches  |  User Settings Forums Tutorial Discussions Sorting Tutorial Why do i need to study different sorting of algorithms? Revision History (1 edit)
 Why do i need to study different sorting of algorithms? 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 sorting-algorithm-internal-variable 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.
 Why do i need to study different sorting of algorithms? I was hoping the article will address this question. Find which 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 internal variable 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.