1.计算1!+2!+……+10!
int main()
{
int n = 0;
int a = 1;
int sum = 0;
for (n=1;n<=10;n++)
{
a = a * n;
sum += a;
}
printf("sum=%d\n", sum);
return 0;
}
优化:(n+1) ! = n! *(n+1) 将n!存储,用于求(n+1)!,无需使用两个for循环重新计算。
2.利用二分法求所找元素(针对有序数列)
int main()
{
int arr[] = {1,2,3,4,5,6,7,8,9,10};
int k = 2;
int left = 0;
int sz = sizeof(arr) / sizeof(arr[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;
}