Algoritmo shell en C

shellsort.c

#include <stdio.h>
#define MAX_NUM 50

int ShellSort(int* const parray, const int size)
{
	int aux;
	int count = 0; 
	int total = 0;
	int* i;
	const int* const psize = parray + size;
	unsigned char change = 0;
	int jumps = size;
	while(1)
	{
		if(jumps != 1)
			jumps /= 2;
		if(jumps == 1)
			change = 1;
		count = 0;
		for(i = parray; i + jumps < psize; ++i)
		{
			++count;		
			if(*(i + jumps) < *i) //Si el elemento siguiente llega a ser menor al anterior, ...
			{
				aux = *(i + jumps);
				*(i + jumps) = *i;
				*i = aux;
				change = 0;
			}			
		}
		total += count;
		if(change) break;
	}
	return total;
}

int main(void)
{
	srand(time(NULL));
	int num[MAX_NUM];
	int tot;
	for(int i = 0; i != MAX_NUM; ++i)
		num[i] = rand() % 100;
	tot = ShellSort(num, MAX_NUM);
	for(int i = 0; i != MAX_NUM; ++i)
		printf("%d\n", num[i]);
	printf("\nTotal de iteraciones: %d\n", tot);
	getchar();
	return 0;
}