Introduction to Sorting
Sorting is the act of storing data in a sorted order, which can be ascending or descending. With the term Searching, the concept of Sorting comes into play. There are numerous things in our daily lives that we need to search for, such as a certain record in a database, roll numbers in a merit list, a specific phone number, a specific page in a book, and so on.
 |
| Sorting in Data Structure |
Sorting puts data in a logical order, making it easier to find what you're looking for. There will be one key for each record that will be sorted. The record will be ordered based on the key. Let's say we have a student database; each record will contain the following information:
- Roll No.
- Name
- Age
- Class
In this case, the student roll number can be used as a sorting key to sort the records in ascending or descending order. If we need to find a student with the number 15, we won't have to look through the entire record; instead, we'll look at the Students with the numbers 10 to 20.
Sorting Efficiency
Sorting can be done in a variety of ways. The application of a specific sorting process is dependent on the situation. The effectiveness of sorting processes is mostly determined by two factors. The first option is the program's execution time, which is the amount of time it takes to run the programme. The second is space, which refers to the amount of space taken up by the software.
Types of Sorting Techniques
There are many types of Sorting techniques, differentiated by their efficiency and space requirements. Following are some sorting techniques which we will be covering in next sections.
