Sorting Techniques

Sorting refers to the arrangement of data items in smaller to larger or larger to smaller order. The porocess in which elements/data items are arranged in small to large is called ascending order, and arrangement of large to small is refer as descending order.

In data structures there are multiple techniques that can be used to sort out data. Some are best for small data sets and some are preferably effective for large data sets. These techniques provide different efficiency. The efficiency of any sorting algorithm is measured in the following ways.

• Time complexity
• Space complexity

Types of Sorting Techniques

There are following common sorting techniques used in data structures. These techniques are also known as sorting algorithms.

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