-:PROGRAM CODE:-
/* Simple Insertion Sort Program Using Functions in C*/
/* Data Structure Programs,C Array Examples */
#include<stdio.h>
#include<conio.h>
#define MAX_SIZE 5
void insertion(int[]);
int main() {
int arr_sort[MAX_SIZE], i;
printf("Simple Insertion Sort Example - Array and Functions\n");
printf("\nEnter %d Elements for Sorting\n", MAX_SIZE);
for (i = 0; i < MAX_SIZE; i++)
scanf("%d", &arr_sort[i]);
printf("\nYour Data :");
for (i = 0; i < MAX_SIZE; i++) {
printf("\t%d", arr_sort[i]);
}
insertion(arr_sort);
getch();
}
void insertion(int fn_arr[]) {
int i, j, a, t;
for (i = 1; i < MAX_SIZE; i++) {
t = fn_arr[i];
j = i - 1;
while (j >= 0 && fn_arr[j] > t) {
DSU Micro-project
8
fn_arr[j + 1] = fn_arr[j];
j = j - 1;
}
fn_arr[j + 1] = t;
printf("\nIteration %d : ", i);
for (a = 0; a < MAX_SIZE; a++) {
printf("\t%d", fn_arr[a]);
}
}
printf("\n\nSorted Data :");
for (i = 0; i < MAX_SIZE; i++) {
printf("\t%d", fn_arr[i]);
}
}
DSU Micro-project
9
-:OUTPUTS:-
Simple Insertion Sort Example - Array and Functions
Enter 5 Elements for Sorting
901
56
34
23
2
Your Data : 901 56
Iteration 1 : 56 901
Iteration 2 : 34 56
Iteration 3 : 23 34
Iteration 4 : 2
23
Sorted Data : 2
23
34
34
901
56
34
23
23
23
901
56
34
56
2
2
2
2
901
901
-----------------(program exited with code: 0)
Press any key to continue . . .
DSU Micro-project
10
DSU Micro-project
11