Program to sort array using Insertion sort
This above example is just a reference picture. don't
think it as an input of an array.
you can give your own input.
#include<math.h>
#include<stdio.h>
void insertionSort(int arr[], int n)
{
int i, key, j;
for (i = 1; i < n; i++) {
key = arr[i];
j = i - 1;
while (j >= 0 && arr[j] > key) {
arr[j + 1] = arr[j];
j = j - 1;
}
arr[j + 1] = key;
}
}
void printArray(int arr[], int n)
{
int i;
for (i = 0; i < n; i++)
printf("%d ", arr[i]);
printf("\n");
}
int main()
{
printf("\n\n Enter the number of data element to be sorted: ");
scanf(“%d”, &n);
printf("\n Enter element: ");
for(i=0; i<n; i++)
{
scanf(“%d”, &arr[i]);
}
int n = sizeof(arr) / sizeof(arr[0]);
insertionSort(arr, n);
printf(“Sorted List: ”);
printArray(arr, n);
return 0;
}
No comments:
Post a Comment