**Sorting in Data Structures** provides a different way in which we can easily sort elements in a particular order.

## Sorting Algorithm

**What is the sorting techniques in data structure?**

Sorting is a process of arranging the data in a particular order.

**Definition**: Arranging a set of data in some kind of order is referred to as sorting.

This can be implemented by many different algorithms.

**Sorting example**

Telephone directory names of persons arranged in alphabetical order.

Consider a simple example of sorting, We are having 5 random numbers as 10 2 19 1 8.

As these are the random number we need to sort the number as, 1 2 8 10 19

We got the sorted list easily but how we sort these random numbers to be sorted.

For this, there are various techniques available in a data structure which are different from each other and performed in a different fashion to arrange the data in a particular order.

### Sorting Techniques in Data Structure

Different techniques or Sorting algorithms in Data Structures to sort elements in order which are as follows:

- Bubble sort
- Selection sort
- Insertion sort
- Merge sort
- Heap sort
- Quick sort
- Binary sort
- Shell sort

we are having different techniques for sorting But these sorting techniques have different time complexity.

### Sorting time complexity

The total time required for the execution of a program is known as time complexity.

We will choose anyone sorting technique whose complexity will be suitable for your needs or we use a sorting technique which is efficient.

Sorting algorithms complexity

### Advantages of sorting

- It will make retrieving and traversing data easy and simple.
- It makes memory management easy.
- Sorting also makes searching easy.