打卡
4.折半法
#define _CRT_SECURE_NO_WARNINGS 1
#include<stdio.h>
int main()
{
int k = 0;
scanf("%d", &k);
int arr[] = { 1,2,3,4,5,6,7,8,9,10 };
int a = sizeof(arr) / sizeof(arr[0]);
int left = 0;
int right = a-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 if (arr[mid] == k)
{
printf("找到啦,在%d\n",mid);
break;
}
}
if (left > right)
printf("找不到");
return 0;
}
5.求阶乘之和
#define _CRT_SECURE_NO_WARNINGS 1
#include<stdio.h>
int main()
{
int i = 0;
int date = 0;
int muti = 1;
int sum = 0;
scanf("%d\n", &date);
for (i = 1; i < date + 1;i++)
{
muti = muti * i;
sum += muti;
}
printf("%d\n", sum);
return 0;
}