Sorting in Data Structure | Sorting Techniques

Sorting

-> Arranging data elements in a meaningful order is known as sorting.
-> we can arrange numbers either in ascending or descending order.
                
           Unsorted data

11

5

22

10

88

           Ascending order    

5

10

11

22

88

           Descending order        

88

22

11

10

5

      

Sorting Techniques

Sorting technique depends on the situation. It depends on two parameters.

1. Execution time of program that means time taken for execution of program.

2. Space that means space taken by the program.

NOTE: Sorting techniques are differentiated by their efficiency and space requirements.

* Various sorting techniques available in data structure are:-

1. Bubble sort (exchange sort)

2. Insertion sort

3. Selection sort

4. Merge sort

5. Quick sort

6. Heap sort