ime_2/Exercícios/10 - Ordenação: Algoritmos .../insertion_sort.c

51 lines
955 B
C

#include <stdlib.h>
#include <stdio.h>
#define array int*
void insertionSort (array A, int size) {
int i, tmp;
if (size-- <= 1)
return;
insertionSort(A, size);
tmp = A[size];
for (i = size; i > 0 && A[i - 1] > tmp; i--)
A[i] = A[i - 1];
A[i] = tmp;
}
array readArray (int *size) {
int d, i = 0;
char c;
array A;
*size = 1;
A = malloc(sizeof(int));
do {
if (!scanf(" %d", &d))
continue;
if (i == *size - 1) {
*size *= 2;
A = realloc(A, *size * sizeof(int));
}
A[i++] = d;
} while ((c = getchar()) != EOF && c != '\n');
*size = i;
return A;
}
int main () {
array A;
int i, size;
printf("This program performs an insertion sort.\nType in a sequence of values separated by spaces and press ENTER: ");
A = readArray(&size);
insertionSort(A, size);
printf("New sequence:\n");
for (i = 0; i < size; i++)
printf("%d ", A[i]);
printf("\n");
return 0;
}