#include <stdio.h>
#include <stdlib.h>

void insertionsort(int a[], int n);
int arrEqu(int a[], int b[], int n);

int main(void) {
	int a[5] = {0,1,2,3,4};
	int ta[5] = {4,3,2,1,0};
	int b[10] = {0,1,2,3,4,5,6,7,8,9};
	int tb[10] = {9,8,7,6,5,4,3,2,1,0};
	
	insertionsort(ta, 5);
	if (arrEqu(a, ta, 5)) {
		puts("sorted");
	} else {
		puts("unsorted");
	}
	
	insertionsort(tb, 10);
	if (arrEqu(b, tb, 10)) {
		puts("sorted");
	} else {
		puts("unsorted");
	}
	
	return EXIT_SUCCESS;
}

void insertionsort(int a[], int n) {
	int i;
	int j;
	int e;
	
	for (i = 1; i < n; i++) {		
		e = a[i];
		
		for (j = i; 0 < j; j--) {
			if (a[j - 1] <= e) {
				break;
			}

			a[j] = a[j - 1];
		}
		
		a[j] = e;
	}
}

int arrEqu(int a[], int b[], int n) {
	int i;
	
	for (i = 0; i < n; i++) {
		if (a[i] != b[i]) {
			return 0;
		}
	}
	return 1;
}

sorted
sorted