There are many operations performed in Data Structures. One of the most important operation of Data Structure is sorting that makes us to search, arrange or locate the record easily and efficiently. There are many sorting algorithms having different-different efficiencies based on the number of inputs. Sorting can also be performed on priority basis which displays required record first and later on remaining records. But we don’t get any changes in complexity. If we give one attribute value, it will take less time. That means the efficiency of searching a record from sorted records increases when we sort on the basis of priorities and attribute’s value. If we implement this process, we can increase our main-power performance as well as tool or application because it will take less time.
No. of Downloads :