C语言-----二分查找（折半）和冒泡排序

代码实现如下：

1.

#include<stdio.h>
//编写函数实现冒泡排序
void bubble_sort(int arr[],int sz) {
	int i = 0;
	for (i = 0; i < sz - 1;i++) {
		int j = 0;
		for (j = 0; j < sz - 1 - i;j++) {
			if (arr[j]>arr[j+1]) {
				int tmp = arr[j];
				arr[j] = arr[j+1];
				arr[j + 1] = tmp;
				flag = 0;
			}
		}
		if (flag==1) {
			break;
		}
	}
}
int main() {
	int arr[] = { 2,2,3,5,9,4,7,4,1 };
	int i = 0;
	int sz = sizeof(arr) / sizeof(arr[0]);
	bubble_sort(arr,sz);
	for (i = 0; i < sz;i++) {
		printf("%d ",arr[i]);
	}
	return 0;
}

---

2.

//二分查找的方法
#include<stdio.h>
int main() {
    int arr[] = { 1,2,3,4,5,6,7,8,9,10 };
    int k = 7;//要查找的数字7
    int sz = sizeof(arr) / sizeof(arr[0]);
    int left = 0;
    int right = sz - 1;
    while (left <= right) {
        int mid = (left + right) / 2;
        if (arr[mid] > k) {
            right = mid - 1;
        }
        else if (arr[mid] < k) {
            left = mid + 1;
        }
        else {
            printf("找到了，下标是：%d\n", mid);
            break;
        }
    }
    if (left>right) {
        printf("找不到\n");
    }
}