Sorting Algorithms

Sorting refers to arranging data in a particular format. Sorting

algorithm specifies the way to arrange data in a particular
order. Most common orders are in numerical or
lexicographical order.

The importance of sorting lies in the fact that data searching

can be optimized to a very high level, if data is stored in a
sorted manner. Sorting is also used to represent data in more
readable formats. Following are some of the examples of
sorting in real-life scenarios −
•Telephone Directory − The telephone
directory stores the telephone numbers of
people sorted by their names, so that the
names can be searched easily.

•Dictionary − The dictionary stores words

in an alphabetical order so that searching
of any word becomes easy.
Stable and Not Stable Sorting
If a sorting algorithm, after sorting the contents, does
not change the sequence of similar content in which
they appear, it is called stable sorting.
If a sorting algorithm, after sorting the contents,
changes the sequence of similar content in which they
appear, it is called unstable sorting.
In-place Sorting and Not-in-place Sorting
Sorting algorithms may require some extra space for
comparison and temporary storage of few data elements.
These algorithms do not require any extra space and sorting
is said to happen in-place, or for example, within the array
itself. This is called in-place sorting. Bubble sort is an
example of in-place sorting.

However, in some sorting algorithms, the program requires

space which is more than or equal to the elements being
sorted. Sorting which uses equal or more space is called not-
in-place sorting. Merge-sort is an example of not-in-place
sorting.
Bubble Sort
In Bubble sort, Each element of the array is compared with its adjacent
element. The algorithm processes the list in passes. A list with n elements
requires n-1 passes for sorting. Consider an array A of n elements whose
elements are to be sorted by using Bubble sort. The algorithm processes
like following.

1.In Pass 1, A[0] is compared with A[1], A[1] is compared with A[2], A[2]
is compared with A[3] and so on. At the end of pass 1, the largest element
of the list is placed at the highest index of the list.
2.In Pass 2, A[0] is compared with A[1], A[1] is compared with A[2] and
so on. At the end of Pass 2 the second largest element of the list is placed
at the second highest index of the list.
3.In pass n-1, A[0] is compared with A[1], A[1] is compared with A[2] and
so on. At the end of this pass. The smallest element of the list is placed at
the first index of the list.
Algorithm Bubble Sort:
•Step 1: Repeat Step 2 For i = 0 to N-1
•Step 2: Repeat For j = 0 to N - i
•Step 3: IF A[j+1] > A[j]
SWAP A[j+1]
and A[j]
[END OF INNER
LOOP]
[END OF OUTER LOOP
•Step 4: EXIT
#include<stdio.h>
void main () Output:
{
int i, j,temp; Printing Sorted Element
int a[10] = { 10, 9, 7, 101, 23, 44, 12, 78, 34, 23};
int n =10;
List . . .
for(i = 0; i<10; i++) 7
{ 9
for(j = 0; j<(n-i); j++) 10
{
if(a[j+1] > a[j]) 12
{ 23
temp = a[j]; 34
a[j] = a[j+1];
a[j+1] = temp;
34
} 44
} 78
}
101
printf("Printing Sorted Element List ...\n");
for(i = 0; i<10; i++)
{
printf("%d\n",a[i]);
}
}
Insertion Sort
Insertion sort is the simple sorting algorithm which
is commonly used in the daily lives while ordering
a deck of cards. In this algorithm, we insert each
element onto its proper place in the sorted array.
This is less efficient than the other sort algorithms
like quick sort, merge sort, etc.

Technique
Consider an array A whose elements are to be
sorted. Initially, A[0] is the only element on the
sorted set. In pass 1, A[1] is placed at its proper
index in the array.
In pass 2, A[2] is placed at its proper index in the
array. Likewise, in pass n-1, A[n-1] is placed at its
proper index into the array.
To insert an element A[k] to its proper index, we
must compare it with all other elements i.e. A[k-
1], A[k-2], and so on until we find an element A[j]

such that, A[j]<=A[k].

All the elements from A[k-1] to A[j] need to be
shifted and A[k] will be moved to A[j+1].
Algorithm (Insertion Sort)

• Step 1: Repeat Steps 2 to 5 for K = 1 to N-1

• Step 2: SET TEMP = ARR[K]
• Step 3: SET J = K - 1
• Step 4: Repeat while TEMP <=ARR[J]
SET ARR[J + 1] = ARR[J]
SET J = J - 1
[END OF INNER LOOP]
• Step 5: SET ARR[J + 1] = TEMP
[END OF LOOP]
• Step 6: EXIT
#include<stdio.h> printf("List after Sorting is: ");
#include<conio.h> for (i = 0; i < size; i++)
void main(){ printf(" %d", list[i]);
int size, i, j, temp, list[100];
printf("Enter the size of the list: "); getch();
scanf("%d", &size); }
printf("Enter %d integer values: ", size);
for (i = 0; i < size; i++)
scanf("%d", &list[i]);

//Insertion sort logic

for (i = 1; i < size; i++) {
temp = list[i];
j = i - 1;
while ((temp < list[j]) && (j >= 0)) {
list[j + 1] = list[j];
j = j - 1;
}
list[j + 1] = temp;
}
Selection Sort
In selection sort, the smallest value among the unsorted
elements of the array is selected in every pass and inserted to
its appropriate position into the array.

First, find the smallest element of the array and place it on

the first position. Then, find the second smallest element of
the array and place it on the second position. The process
continues until we get the sorted array.
The array with n elements is sorted by using n-1 pass of
selection sort algorithm.
•In 1st pass, smallest element of the array is to be found along
with its index pos. then, swap A[0] and A[pos]. Thus A[0] is
sorted, we now have n -1 elements which are to be sorted.

•In 2nd pas, position pos of the smallest element present in the
sub-array A[n-1] is found. Then, swap, A[1] and A[pos]. Thus
A[0] and A[1] are sorted, we now left with n-2 unsorted
elements.

•In n-1th pass, position pos of the smaller element between

A[n-1] and A[n-2] is to be found. Then, swap, A[pos] and A[n-
1].
Therefore, by following the above explained process, the
elements A[0], A[1], A[2],...., A[n-1] are sorted.
Step by Step Process
The selection sort algorithm is performed using the following steps...

•Step 1 - Select the first element of the list (i.e., Element at first position
in the list).

•Step 2: Compare the selected element with all the other elements in
the list.

•Step 3: In every comparision, if any element is found smaller than the

selected element (for Ascending order), then both are swapped.

•Step 4: Repeat the same procedure with element in the next position
in the list till the entire list is sorted.
#include <stdio.h>
int main()
{
int a[100], n, i, j, position, swap;
printf("Enter number of elementsn");
scanf("%d", &n);
printf("Enter %d Numbersn", n);
for (i = 0; i < n; i++)
scanf("%d", &a[i]);
for(i = 0; i < n - 1; i++)
{
position=i;
for(j = i + 1; j < n; j++)
{
if(a[position] > a[j])
position=j;
}
if(position != i)
{
swap=a[i];
a[i]=a[position];
a[position=swap;
}
}
printf("Sorted Array:n");
for(i = 0; i < n; i++)
printf("%dn", a[i]);
return 0;
}
Merge sort

Merge sort is the algorithm which follows divide and conquer approach.
Consider an array A of n number of elements. The algorithm processes the
elements in 3 steps.

1.If A Contains 0 or 1 elements then it is already sorted, otherwise, Divide A

into two sub-array of equal number of elements.

2.Conquer means sort the two sub-arrays recursively using the merge sort.

3.Combine the sub-arrays to form a single final sorted array maintaining the
ordering of the array.
The main idea behind merge sort is that, the short list takes less time to be
sorted.
Consider the following array of 7 elements.
Sort the array by using merge sort.
1.A = {10, 5, 2, 23, 45, 21, 7}
Algorithm •IF I > MID
•Step 1: [INITIALIZE] SET I = Repeat while J <= END
SET TEMP[INDEX] = ARR[J]
BEG, J = MID + 1, INDEX = 0
SET INDEX = INDEX + 1, SET J = J + 1
•Step 2: Repeat while (I <= MID)
[END OF LOOP]
AND (J<=END) [Copy the remaining elements of
IF ARR[I] < ARR[J] left sub-array, if any]
SET TEMP[INDEX] = ARR[I] ELSE
SET I = I + 1 Repeat while I <= MID
ELSE SET TEMP[INDEX] = ARR[I]
SET TEMP[INDEX] = ARR[J] SET INDEX = INDEX + 1, SET I = I + 1
[END OF LOOP]
SET J = J + 1
[END OF IF]
[END OF IF] •Step 4: [Copy the contents of TEMP back to
SET INDEX = INDEX + 1 ARR] SET K = 0
[END OF LOOP] •Step 5: Repeat while K < INDEX
Step 3: [Copy the remaining SET ARR[K] = TEMP[K]
elements of right sub-array, if SET K = K + 1
any] [END OF LOOP]
•Step 6: Exit
MERGE_SORT(ARR, BEG, END)

• Step 1: IF BEG < END

SET MID = (BEG + END)/2
CALL MERGE_SORT (ARR, BEG, MID)
CALL MERGE_SORT (ARR, MID + 1, END)
MERGE (ARR, BEG, MID, END)
[END OF IF]
• Step 2: END
Radix Sort

 Radix sort processes the elements the same way in which the names of the
students are sorted according to their alphabetical order. There are 26 radix in
that case due to the fact that, there are 26 alphabets in English.

 In the first pass, the names are grouped according to the ascending order of
the first letter of names.

 In the second pass, the names are grouped according to the ascending order
of the second letter.

 The same process continues until we find the sorted list of names. The bucket
are used to store the names produced in each pass. The number of passes
depends upon the length of the name with the maximum letter.
In the case of integers, radix sort sorts the numbers according to
their digits. The comparisons are made among the digits of the
number from LSB to MSB. The number of passes depend upon the
length of the number with the most number of digit

Example
Consider the array of length 6 given below.
Sort the array by using Radix sort.

A = {10, 2, 901, 803, 1024}

Pass 1: (Sort the list according to the digits at 0's place)

10, 901, 2, 803, 1024.

Pass 2: (Sort the list according to the digits at 10's place)

02, 10, 901, 803, 1024
Pass 3: (Sort the list according to the digits at 100's place)
02, 10, 1024, 803, 901.

Pass 4: (Sort the list according to the digits at 1000's

place)
02, 10, 803, 901, 1024

Therefore, the list generated in the step 4 is the sorted list,

arranged from radix sort.
Algorithm (Radix Sort)

• Step
1:Find the largest number in ARR as LARGE
• Step
2: [INITIALIZE] SET NOP = Number of digits in LARGE
• Step
3: Now, create d buckets of size 0 - 9 , where d = NOP
• Step
4: for i -> 0 to d
 sort the array elements using counting sort (or any stable
sort) according to the digits at the ith place
• Step 5: END
Algorithm (Counting Sort in Radix Sort)
Algorithm (Radix Sort Implementation)
// Radix sort Function
void radixsort(int arr[], int n)
{
int m = getMax(arr, n);
// Do counting sort for every digit.
for (int exp = 1; m / exp > 0; exp *= 10)
countSort(arr, n, exp);
}

// Function to return maximum

int getMax(int arr[], int n)
{
int max = arr[0];
for (int i = 1; i < n; i++)
if (arr[i] > max)
max = arr[i];
return max;
}
void countSort(int arr[], int n, int exp)
{
int output[n];
int i, count[10] = { 0 };
// Store count of occurrences in count[]
for (i = 0; i < n; i++)
count[(arr[i] / exp) % 10]++;
// Change count[i] so that count[i] now contains actual
position of this digit in output[]
for (i = 1; i < 10; i++)
count[i] += count[i - 1];

// Build the output array

for (i = n - 1; i >= 0; i--) {
output[count[(arr[i] / exp) % 10] - 1] = arr[i];
count[(arr[i] / exp) % 10]--;
}
// Copy the output array to arr[],
for (i = 0; i < n; i++)
arr[i] = output[i];
}
Shell Sort

 Shell sort is the generalization of insertion sort which overcomes the

drawbacks of insertion sort by comparing elements separated by a gap of
several positions.

 As similar to insertion sort, it is a comparison-based and in-place sorting

algorithm.

 As similar to insertion sort, it is a comparison-based and in-place sorting

algorithm.
Algorithm (Shell Sort)
ShellSort(a, n) // 'a' is the given array, 'n' is the size of array
for (interval = n/2; interval > 0; interval /= 2)
{
for ( i = interval; i < n; i += 1)
{
temp = a[i];
for (j = i; j >= interval && a[j - interval] > temp; j -= interval)
a[j] = a[j - interval];
a[j] = temp;
}
}
Example (Shell Sort)

In the first loop, n is equal to 8 (size of the array), so the elements are lying at the
interval of 4 (n/2 = 4). Elements will be compared and swapped if they are not in
order.
Example continue…

After comparing and swapping, the

updated array will look as follows -
 Example continue…
In the second loop, elements are lying at the interval of 2 (n/4 = 2), where n = 8.

Now, we are taking the interval of 2 to sort the rest of the array. With an interval of
2, two sublists will be generated - {12, 25, 33, 40}, and {17, 8, 31, 42}.

After comparing and swapping, the

updated array will look as follows
 Example continue…
In the third loop, elements are lying at the
interval of 1 (n/8 = 1), where n = 8. At last, we
use the interval of value 1 to sort the rest of the
array elements. In this step, shell sort uses
insertion sort to sort the array elements.
Thanks