DS Sorting techniques and algorithms with complexity

SORTING TECHNIQUES

Sorting is nothing but storage of data in ascending or descending order.

There are many sorting techniques available. The efficiency of any sorting technique depends on two parameters:

• Execution time of program
• Space taken by program

DIFFERENT SORTING TECHNIQUES

The different sorting techniques are as follows:

1. Bubble Sort
2. Insertion Sort
3. Selection Sort
4. Quick Sort
5. Merge Sort
6. Heap Sort

COMPLEXITY OF SORTING ALGORITHMS

The complexities of different sorting algorithms are listed as follows: