计算1!+2!+……+10!
#include<stdio.h>
int main()
{
//计算1!+2!+……+10!
int i;
int j = 0;
int m = 1;
int n = 0;
for (n = 1; n <= 10; n++)
{
m = m*n;
j = j + m;
}
printf("sum=%d\n", j);
return 0;
计算1!+2!+……+10!
//int i;
//int j = 0;
//int m = 1;
//int n = 0;
//for (n = 1; n <= 10; n++)
//{
// m = 1;
// for (i = 1; i <= n; i++)
// {
// m = m*i;
// }
// j = j + m;
//}
//printf("sum=%d\n", j);
//return 0;
}
二分查找算法
#include<stdio.h>
int main()
{
int arr[] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 };
int sz = sizeof(arr) / sizeof(arr[0]);//计算元素个数
int left = 0;//左下标
int right = sz - 1; //右下标
int k = 11;
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("find,subscript is %d\n", mid);
break;
}
}
if (left>right)
{
printf("not find\n");
}
return 0;
}