gistfile1.h

// Mergesort functions
void cz_merge(uint32_t *left, uint32_t *right, uint32_t *array, int length) {
	
	for (int li = 0; li < (length / 2); li++) {
		array[li] = left[li];
	}
	
	for (int ri = 0; ri < ((length - 1) / 2 + 1); ri++) {
		array[(length / 2) + ri] = right[ri];
	}
	
}
void cz_mergesort(uint32_t *array, int length) {
	
	if (length <= 1) return;
	
	uint32_t left[length / 2];
	uint32_t right[((length - 1) / 2 + 1)];
	
	for (int li = 0; li < (length / 2); li++) {
		left[li] = array[li];
	}
	
	for (int ri = 0; ri < ((length - 1) / 2 + 1); ri++) {
		right[ri] = array[((length - 1) / 2 + 1) + ri];
	}
	
	cz_mergesort(left, (length / 2));
	cz_mergesort(right, ((length - 1) / 2 + 1));
	cz_merge(left, right, array, length);
	
}