stooge排序---C语言

#include “stdio.h”

stooge_sort(int key[], int i, int j)

{

int k;

if(key[i] > key[j]){

int temp = key[i];

key[i] = key[j];

key[j] = temp;

}

if (i + 1 >= j) return;

k = (j - i + 1) / 3;

stooge_sort(key, i, j - k);

stooge_sort(key, i + k, j);

stooge_sort(key, i, j - k);

}

int main(void)

{

int key[] = {2,78,5,12,47,31,3,26,14,88,5};

int loop;

int len;

len = sizeof(key) / sizeof(int);

stooge_sort(key, 0, len - 1);

for(loop = 0; loop < len; loop++)

printf("%d ", key[loop]);

scanf("%d", &len);

return 0;

}