forked from jainaman224/Algo_Ds_Notes
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Insertion_Sort.c
54 lines (45 loc) · 863 Bytes
/
Insertion_Sort.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
#include <stdio.h>
// Function for insertion sort
void Insertion_Sort(int array[], int size)
{
int temp, j, i;
for(i = 1; i < size; i++)
{
temp = array[i];
j = i - 1;
// Do swapping
while(j >= 0 && array[j] > temp)
{
array[j + 1] = array[j];
j--;
}
array[j + 1] = temp;
}
}
// Function to print elements of array
void Print_Array(int array[], int size)
{
for(int i = 0; i < size; i++)
printf("%d\t",array[i]);
printf("\n");
}
// Driver Function
int main()
{
int num;
scanf("%d", &num);
int array[num];
for (int i = 0; i < num; i++) {
scanf("%d", &array[i]);
}
Insertion_Sort(array, num);
Print_Array(array, num);
return 0;
}
/*
Input :
num = 6
array = [1, 6, 3, 3, 5, 2]
Output :
[1, 2, 3, 3, 5, 6]
*/