mirror of https://github.com/TheAlgorithms/C
63 lines
1.2 KiB
C
63 lines
1.2 KiB
C
// sorting of array list using insertion sort
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
|
|
/*Displays the array, passed to this method*/
|
|
void display(int *arr, int n)
|
|
{
|
|
int i;
|
|
for (i = 0; i < n; i++)
|
|
{
|
|
printf("%d ", arr[i]);
|
|
}
|
|
printf("\n");
|
|
}
|
|
|
|
/*This is where the sorting of the array takes place
|
|
arr[] --- Array to be sorted
|
|
size --- Array Size
|
|
*/
|
|
void insertionSort(int *arr, int size)
|
|
{
|
|
int i, j, key;
|
|
for (i = 0; i < size; i++)
|
|
{
|
|
j = i - 1;
|
|
key = arr[i];
|
|
/* Move all elements greater than key to one position */
|
|
while (j >= 0 && key < arr[j])
|
|
{
|
|
arr[j + 1] = arr[j];
|
|
j = j - 1;
|
|
}
|
|
/* Find a correct position for key */
|
|
arr[j + 1] = key;
|
|
}
|
|
}
|
|
|
|
int main(int argc, const char *argv[])
|
|
{
|
|
int n;
|
|
printf("Enter size of array:\n");
|
|
scanf("%d", &n); // E.g. 8
|
|
|
|
printf("Enter the elements of the array\n");
|
|
int i;
|
|
int *arr = (int *)malloc(n * sizeof(int));
|
|
for (i = 0; i < n; i++)
|
|
{
|
|
scanf("%d", &arr[i]);
|
|
}
|
|
|
|
printf("Original array: ");
|
|
display(arr, n);
|
|
|
|
insertionSort(arr, n);
|
|
|
|
printf("Sorted array: ");
|
|
display(arr, n);
|
|
|
|
free(arr);
|
|
return 0;
|
|
}
|