折中排序

#include  
#include  
#define  MAX  100

int binarySearch(int list[], int n, int key, int *count) {
	int low = 0, high = n - 1, num = 0;
	int t = (low + high) / 2;
	while (low  list[j + 1]) {
				t = list[j + 1];
				list[j + 1] = list[j];
				list[j] = t;
			}
		}
	}

}

int  main() {
	int  i, n, key, count = 0;
	int  a[MAX];
	while (scanf("%d", &n) == 1) {
		for (i = 0; i = 0) {
			printf("%d  [%d]n", i + 1, count);
		} else {
			printf("no  [%d]n", count);
		}
	}
	return  0;
}