添加算法

algorithm/二分查找.c

+#include <stdio.h>
+
+#define N 9
+
+int bsearch(int *array, int num, int key)
+{
+	int low = 0, high = num - 1, mid;
+	while (low <= high)
+	{
+		mid = (low + high) / 2;
+		int temp = array[mid];
+		if (temp == key)
+			return mid;
+		else if (temp > key)
+			high = mid - 1;
+		else
+			low = mid + 1;
+	}
+	return -1;
+}
+
+int main()
+{
+	int array[N], key;
+	printf("输入升序排列的%d个数：", N);
+	for (int index = 0; index < N; ++index)
+		scanf("%d", &array[index]);
+	printf("输入查找数：");
+	scanf("%d", &key);
+	int index = bsearch(array, N, key);
+	if (index >= 0)
+		printf("array[%d] = %d\n", index, array[index]);
+	else
+		puts("不存在查找数");
+	return 0;
+}

algorithm/冒泡排序.c

+#include <stdio.h>
+
+#define N 9
+
+void sort(int *array, int num)
+{
+	for (int i = num - 1; i > 0; --i)
+		for (int j = 0; j < i; ++j)
+			if (array[j] > array[j + 1])
+			{
+				int temp = array[j + 1];
+				array[j + 1] = array[j];
+				array[j] = temp;
+			}
+}
+
+int main()
+{
+	int array[N], x;
+	printf("%d\n", N);
+	for (int i = 0; i < N; ++i)
+		scanf("%d", &array[i]);
+	sort(array, N);
+	for (int i = 0; i < N; ++i)
+		printf("%d ", array[i]);
+	return 0;
+}