1.在一个有序数组中查找具体的某个数字
#include<stdio.h>
int main()
{
int arr[] = { 1,2,3,4,5,6,7,8,9,10 };
int k = 6; //要查找的数字
//在arr这个有序的数组中查找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)
{
left = mid + 1;
}
else if (arr[mid] > k)
{
right = mid - 1;
}
else
{
printf("找到了,下标是:%d \n", mid);
break;
}
}
if (left > right)
{
printf("找不到了\n");
}
return 0;
}
2.演示多个字符从两端移动,向中间汇聚
#include<windows.h>
#include<string.h>
#include<stdio.h>
int main()
{
char arr1[] = "welcome to home !!!!!";
char arr2[] = "#####################";
int left = 0;
int right = strlen(arr1) - 1;
while (left <= right)
{
arr2[left] = arr1[left];
arr2[right] = arr1[right];
printf("%s \n", arr2);
Sleep(1000); //延时1秒
left++;
right--;
}
printf(" % s \n", arr2);
return 0;
}