C-折半查找算法、二分查找算法

 C_练习

#define _CRT_SECURE_NO_WARNINGS 1

#include
int main()
{
	int arr[] = { 1,2,3,4,5,6,7,8,9,10 };
	int k = 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", mid);
			break;
		}
	}
	if (left > right)
	{
		printf("找不到！");
	}
	return 0;
}
//折半查找算法、二分查找算法

 1 #define _CRT_SECURE_NO_WARNINGS 1
 2 
 3 #include
 4 #include
 5 #include
 6 int main()
 7 {
 8     char arr1[] = "welcome to bit!";
 9     char arr2[] = "###############";
10 
11     int left = 0;
12     int right = strlen(arr1) - 1;
13 
14     while (left <= right)
15     {
16         arr2[left] = arr1[left];
17         arr2[right] = arr1[right];
18         printf("%s\n", arr2);
19         //休息一秒
20         Sleep(1000);
21         left++;
22         right--;
23     }
24     return 0;
25 }
26 //折半查找算法、二分查找算法