C语言简单的二分查找和冒泡排序;

二分查找如下

程序代码:

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
练习二分查找
int Find(int* arr,int len,int a) {
	int left = 0;
	int right = len - 1;
	while (left<=right){
	int	m = (left + right) >>1 ;
		if (arr[m] == a) {
			return 1;
		}
		else if (arr[m] > a) {
			right = m - 1;
		}
		else {
			left = m + 1;
		}
	}
		return -1;

}
int main() {
	int arr[] = { 1,2,3,4,5,6,7,8,9 };
	int len = sizeof(arr)/sizeof(arr[0]);
	int a = 71;
	int b=Find(arr,len,a);
	if (b== 1) {
		printf("找到了\n");
	}
	else if(b==-1){
		printf("没找到\n");
	}
	printf("%d", len);
	system("pause");
	return 0;
}

冒泡排序如下:

//练习冒泡排序
#include<stdio.h>
#include<stdlib.h>
int main() {
	int arr[] = { 9,8,7,6,5,4,3,2,1,0};
	int len = sizeof(arr) / sizeof(arr[0]);
	printf("%d\n", len);
	int i, j;
	int ret = 0;
	for (i = 0; i < len-1; i++) {
		for (j = 0; j < len - i-1; j++) {
			if (arr[j] > arr[j + 1]) { //升序,从小到大排列
				ret = arr[j];
				arr[j] = arr[j + 1];
				arr[j + 1] = ret;
			}
		}
	}
	for (i = 0; i < len; i++) {
		printf("%d", arr[i]);
	}
	system("pause");
	return 0;
}