The document outlines the insertion sort algorithm, detailing the method of sorting an array by repeatedly moving elements into their correct position. It describes the process through iterations where elements are swapped based on their value relative to previous sorted elements. Additionally, it includes a C programming implementation of the insertion sort algorithm with an example of an array to be sorted.

1. INSERTION SORT
SOUMEN SANTRA
MCA, M.Tech, SCJP, MCP
1

2. ALGORITHM
2
Insertion_Sort(array, size)
Begin
Select first element as sorted store as pos
for each unsorted element i
While array of j < last_Sorted_Element_Index to 0
if current element j > pos
move sorted element by 1 position to the right
break loop and insert pos at empty position
End

3. Insertion Sort Steps
• Iteration i. Again and Again swap element i with the one to its left
element if previous one is smaller.
• Operation. After ith iteration, a[0] through a[i] contain first i+1
elements in ascending order.
3
0.50 1.13 1.19 0.312.95 7.33 3.07 7.75Value 6.25 3.98
Iteration 0: step 0.
2 3 4 50 1 8 9Array index 6 7

4. Insertion Sort Steps
• Iteration i. Again and Again swap element i with the one to its left
element if previous one is smaller.
• Operation. After ith iteration, a[0] through a[i] contain first i+1
elements in ascending order.
4
0.50 1.13 1.19 0.312.95 7.33 3.07 7.75Value 6.25 3.98
Iteration 1: step 0.
2 3 4 50 1 8 9Array index 6 7

5. Insertion Sort Steps
• Iteration i. Again and Again swap element i with the one to its left
element if previous one is smaller.
• Operation. After ith iteration, a[0] through a[i] contain first i+1
elements in ascending order.
5
0.50 1.13 1.19 0.312.95 7.33 3.07 7.75Value 6.25 3.98
Iteration 2: step 0.
0.50 7.33
2 3 4 50 1 8 9Array index 6 7

6. Insertion Sort Steps
• Iteration i. Again and Again swap element i with the one to its left
element if previous one is smaller.
• Operation. After ith iteration, a[0] through a[i] contain first i+1
elements in ascending order.
6
7.33 1.13 1.19 0.312.95 0.50 3.07 7.75Value 6.25 3.98
Iteration 2: step 1.
0.50 2.95
2 3 4 50 1 8 9Array index 6 7

7. Insertion Sort Steps
• Iteration i. Again and Again swap element i with the one to its left
element if previous one is smaller.
• Operation. After ith iteration, a[0] through a[i] contain first i+1
elements in ascending order.
7
7.33 1.13 1.19 0.312.950.50 3.07 7.75Value 6.25 3.98
Iteration 2: step 2.
2 3 4 50 1 8 9Array index 6 7

8. Insertion Sort Steps
• Iteration i. Again and Again swap element i with the one to its left
element if previous one is smaller.
• Operation. After ith iteration, a[0] through a[i] contain first i+1
elements in ascending order.
8
7.33 1.13 1.19 0.312.950.50 3.07 7.75Value 6.25 3.98
Iteration 3: step 0.
1.13 7.33
2 3 4 50 1 8 9Array index 6 7

9. Insertion Sort Steps
• Iteration i. Again and Again swap element i with the one to its left
element if previous one is smaller.
• Operation. After ith iteration, a[0] through a[i] contain first i+1
elements in ascending order.
9
7.331.13 1.19 0.312.950.50 3.07 7.75Value 6.25 3.98
Iteration 3: step 1.
1.13 2.95
2 3 4 50 1 8 9Array index 6 7

10. Insertion Sort Steps
• Iteration i. Again and Again swap element i with the one to its left
element if previous one is smaller.
• Operation. After ith iteration, a[0] through a[i] contain first i+1
elements in ascending order.
10
7.331.13 1.19 0.312.950.50 3.07 7.75Value 6.25 3.98
Iteration 3: step 2.
2 3 4 50 1 8 9Array index 6 7

11. Insertion Sort Steps
• Iteration i. Again and Again swap element i with the one to its left
element if previous one is smaller.
• Operation. After ith iteration, a[0] through a[i] contain first i+1
elements in ascending order.
11
7.331.13 1.19 0.312.950.50 3.07 7.75Value 6.25 3.98
Iteration 4: step 0.
1.19 7.33
2 3 4 50 1 8 9Array index 6 7

12. Insertion Sort Steps
• Iteration i. Again and Again swap element i with the one to its left
element if previous one is smaller.
• Operation. After ith iteration, a[0] through a[i] contain first i+1
elements in ascending order.
12
7.331.13 1.19 0.312.950.50 3.07 7.75Value 6.25 3.98
2 3 4 50 1 8 9Array index 6 7
Iteration 4: step 1.
1.19 2.95

13. Insertion Sort Steps
• Iteration i. Again and Again swap element i with the one to its left
element if previous one is smaller.
• Operation. After ith iteration, a[0] through a[i] contain first i+1
elements in ascending order.
13
7.331.13 1.19 0.312.950.50 3.07 7.75Value 6.25 3.98
Iteration 4: step 2.
2 3 4 50 1 8 9Array index 6 7

14. Insertion Sort Steps
• Iteration i. Again and Again swap element i with the one to its left
element if previous one is smaller.
• Operation. After ith iteration, a[0] through a[i] contain first i+1
elements in ascending order.
14
7.331.13 1.19 0.312.950.50 3.07 7.75Value 6.25 3.98
Iteration 5: step 0.
0.31 7.33
2 3 4 50 1 8 9Array index 6 7

15. Insertion Sort Steps
• Iteration i. Again and Again swap element i with the one to its left
element if previous one is smaller.
• Operation. After ith iteration, a[0] through a[i] contain first i+1
elements in ascending order.
15
7.331.13 1.19 0.312.950.50 3.07 7.75Value 6.25 3.98
Iteration 5: step 1.
0.31 2.95
2 3 4 50 1 8 9Array index 6 7

16. Insertion Sort Steps
• Iteration i. Again and Again swap element i with the one to its left
element if previous one is smaller.
• Operation. After ith iteration, a[0] through a[i] contain first i+1
elements in ascending order.
16
7.331.13 1.19 0.31 2.950.50 3.07 7.75Value 6.25 3.98
Iteration 5: step 2.
0.31 1.19
2 3 4 50 1 8 9Array index 6 7

17. Insertion Sort Steps
• Iteration i. Again and Again swap element i with the one to its left
element if previous one is smaller.
• Operation. After ith iteration, a[0] through a[i] contain first i+1
elements in ascending order.
17
7.331.13 1.190.31 2.950.50 3.07 7.75Value 6.25 3.98
Iteration 5: step 3.
0.31 1.13
2 3 4 50 1 8 9Array index 6 7

18. Insertion Sort Steps
• Iteration i. Again and Again swap element i with the one to its left
element if previous one is smaller.
• Operation. After ith iteration, a[0] through a[i] contain first i+1
elements in ascending order.
18
7.331.13 1.190.31 2.950.50 3.07 7.75Value 6.25 3.98
Iteration 5: step 4.
0.31 0.50
2 3 4 50 1 8 9Array index 6 7

19. Insertion Sort Steps
• Iteration i. Again and Again swap element i with the one to its left
element if previous one is smaller.
• Operation. After ith iteration, a[0] through a[i] contain first i+1
elements in ascending order.
19
7.331.13 1.190.31 2.950.50 3.07 7.75Value 6.25 3.98
Iteration 5: step 5.
2 3 4 50 1 8 9Array index 6 7

20. Insertion Sort Steps
• Iteration i. Again and Again swap element i with the one to its left
element if previous one is smaller.
• Operation. After ith iteration, a[0] through a[i] contain first i+1
elements in ascending order.
20
7.331.13 1.190.31 2.950.50 3.07 7.75Value 6.25 3.98
Iteration 6: step 0.
6.25 7.33
2 3 4 50 1 8 9Array index 6 7

21. Insertion Sort Steps
• Iteration i. Again and Again swap element i with the one to its left
element if previous one is smaller.
• Operation. After ith iteration, a[0] through a[i] contain first i+1
elements in ascending order.
21
7.331.13 1.190.31 2.950.50 3.07 7.75Value 6.25 3.98
Iteration 6: step 1.
2 3 4 50 1 8 9Array index 6 7

22. Insertion Sort Steps
• Iteration i. Again and Again swap element i with the one to its left
element if previous one is smaller.
• Operation. After ith iteration, a[0] through a[i] contain first i+1
elements in ascending order.
22
7.331.13 1.190.31 2.950.50 3.07 7.75Value 6.25 3.98
Iteration 7: step 0.
3.98 7.33
2 3 4 50 1 8 9Array index 6 7

23. Insertion Sort Steps
• Iteration i. Again and Again swap element i with the one to its left
element if previous one is smaller.
• Operation. After ith iteration, a[0] through a[i] contain first i+1
elements in ascending order.
23
7.331.13 1.190.31 2.950.50 3.07 7.75Value 6.25 3.98
Iteration 7: step 1.
3.98 6.25
2 3 4 50 1 8 9Array index 6 7

24. Insertion Sort Steps
• Iteration i. Again and Again swap element i with the one to its left
element if previous one is smaller.
• Operation. After ith iteration, a[0] through a[i] contain first i+1
elements in ascending order.
24
7.331.13 1.190.31 2.950.50 3.07 7.75Value 6.253.98
Iteration 7: step 2.
2 3 4 50 1 8 9Array index 6 7

25. • Iteration i. Again and Again swap element i with the one to its left
element if previous one is smaller.
• Operation. After ith iteration, a[0] through a[i] contain first i+1
elements in ascending order.
25
7.331.13 1.190.31 2.950.50 3.07 7.75Value 6.253.98
Iteration 8: step 0.
3.07 7.33
2 3 4 50 1 8 9Array index 6 7
Insertion Sort Steps

26. Insertion Sort Steps
• Iteration i. Again and Again swap element i with the one to its left
element if previous one is smaller.
• Operation. After ith iteration, a[0] through a[i] contain first i+1
elements in ascending order.
26
7.331.13 1.190.31 2.950.50 3.07 7.75Value 6.253.98
Iteration 8: step 1.
3.07 6.25
2 3 4 50 1 8 9Array index 6 7

27. Insertion Sort Steps
• Iteration i. Again and Again swap element i with the one to its left
element if previous one is smaller.
• Operation. After ith iteration, a[0] through a[i] contain first i+1
elements in ascending order.
27
7.331.13 1.190.31 2.950.50 3.07 7.75Value 6.253.98
Iteration 8: step 2.
3.07 3.98
2 3 4 50 1 8 9Array index 6 7

28. Insertion Sort Steps
• Iteration i. Again and Again swap element i with the one to its left
element if previous one is smaller.
• Operation. After ith iteration, a[0] through a[i] contain first i+1
elements in ascending order.
28
7.331.13 1.190.31 2.950.50 3.07 7.75Value 6.253.98
Iteration 8: step 3.
2 3 4 50 1 8 9Array index 6 7

29. Insertion Sort Steps
• Iteration i. Again and Again swap element i with the one to its left
element if previous one is smaller.
• Operation. After ith iteration, a[0] through a[i] contain first i+1
elements in ascending order.
29
7.331.13 1.190.31 2.950.50 3.07 7.75Value 6.253.98
Iteration 9: step 0.
2 3 4 50 1 8 9Array index 6 7

30. Insertion Sort Steps
• Iteration i. Again and Again swap element i with the one to its left
element if previous one is smaller.
• Operation. After ith iteration, a[0] through a[i] contain first i+1
elements in ascending order.
30
7.331.13 1.190.31 2.950.50 3.07 7.75Value 6.253.98
Iteration 10: ALL SORTED.
2 3 4 50 1 8 9Array index 6 7

31. Implementation in C
31
#include <stdio.h>
void Display(int array[], int size)
{
for (int i = 0; i < size; i++)
{ printf("%f ", array[i]); }
printf("n");
}
void Insertion_Sort(int array[], int size)
{
for (int i = 1; step < sizeofArray; step++)
{
int pos = array[i];
int j = i - 1;
while (pos < array[j] && j >= 0)
{
array[j + 1] = array[j];
--j;
}
array[j + 1] = pos;
}
}
void main()
{
float array[] = {2.95,7.33,0.50,1.13,1.19,0.31,6.25,3.98,3.07,7.75};
int sizeofArray = sizeof(array) / sizeof(array[0]);
Insertion_Sort(data, size);
printf("Sorted array in ascending order:n");
Display(array, size); }

32. THANK YOU
GIVE FEEDBACK
32