|
- In many applications it is necessary to order give objects as per an attribute. For example, arranging a list of student information in increasing order of their roll numbers or arranging a set of words in alphabetical order.
- The attribute by which objects are arranged or sorted is called key. In the first example roll number is the key.
- One class of sorting methods are based on comparisons. Most important methods in this class are Insertion, Sink, Selection, Quick, Merge, and Heap sort algorithms. We have already discussed Insertion sort algorithms in the module 2. We discuss some of these algorithms in this module.
|
|