Since the beginning of the programming age, computer scientists have been working on solving the problem of sorting by coming up with various different algorithms to sort data. Sorting in data structure is the arrangement of data in preferred order. Most common orders are in numerical or lexicographical order. The importance of sorting lies in the fact that data searching can be optimized to a very high level if data is stored in a sorted manner. Sorting is also used to represent data in more readable formats. It is the operation performed to arrange the records of a table or list in some order according to some specific ordering criterion. Sorting is performed according to some key value of each record. The records are sorted either numerically or alphanumerically. The records are then arranged in ascending or descending order depending on the numerical value of the key. Techniques of sorting can be divided into two categories: internal sorting and external sorting. The main advantage of sorting is time complexity and that is the most important thing when you solve a problem.

Payal Jain

185 resources

1

2

0

Like