冒泡排序和折半查找

#include <stdio.h>

#define L 11

int main(void) {
	int a[L];
	int i, j, key, t;
	for(i = 0, j = (L - 1) * 3; j >= 0; j -= 3, i++) {
		a[i] = j;
	}
	for(i = 0; i < L; i++) {
		printf("%d ", a[i]);
	}
	printf("\n\n");
	for(i = 0; i < L - 1; i++) {
		for(j = 0 ; j < L - i - 1; j++) {
			if(a[j] > a[j + 1]) {
				t = a[j];
				a[j] = a[j + 1];
				a[j + 1] = t;
			}
		}
	}
	for(i = 0; i < L; i++) {
		printf("%d ", a[i]);
	}
	printf("\n\n");
	int middle, low, high;
	low = 0;
	high = L - 1;
	i = 0;
	key = 30;
	while(low <= high) {
		middle = (low + high) / 2;
		if(key == a[middle]) {
			printf("Position is %d == %d", middle, a[middle]);
			break;
		} else if(key < a[middle]) {
			high = middle - 1;
		} else {
			low = middle + 1;
		}
		i++;
	}
	printf("\n%d \n", i);
}