c回顾之day5_p

 

1、计算n的阶乘；

2、计算1！+2！+3！+......+10！；

3、在一个有序数组中查找具体某个数字n。编写int binSearch(int x, int v[], int n)；

4、写一个函数每次调用此函数num的之就会增1。

 

 

#include<stdio.h>
#include<stdlib.h>//srand()//rand()
#include<time.h>
#include<windows.h>

int factorial(int n)
{
	//递归
	if(1 == n){//每个数传进来会有自己相对的返回值
		return 1;
	}
	return n*factorial(n-1);

	//一般方法
	/*int i = 1;
	int sum = 1;
	for(; i <= n; i++){
		sum *= i;
	}
	return sum;*/
}

int factorialAdd(int n)
{
	int i = 1;
	int sum = 0;
	for(; i <= n; i++){
		sum += factorial(i);
	}
	return sum;
}

int binSearch(int x, int v[], int n)
{
	int left = 0;
	int right = n - 1;
	int mid = 0;
	while(left <= right){
		mid = (left+right)/2;
		if(v[mid] > x){
			right = mid - 1;
		}
		else if(v[mid] < x){
			left = mid + 1;
		}
		else
			return mid;
	}
	return -1;
}

int increment()
{
	static int num = 0;
	return ++num;
}

//此函数是用num自增的函数测试产生的随机数的值
void incrementTest()
{
	int i = 0;
	srand((unsigned)time(NULL));//void srand( unsigned int seed);种子
	for(; i < rand()%100; i++){
		increment();
	}
}

int main()
{
	//int n;
	//scanf("%d",&n);
	//printf("%d\n",factorial(n));
	printf("%d\n",factorialadd(n));

	/*int sear_num;
	int bin_arr[10];
	int i = 0;
	for(; i < 10; i++){
		bin_arr[i] = i*i-1;
	}
	scanf("%d",&sear_num);
	printf("%d\n",binSearch(sear_num, bin_arr, 10));*/
	
	incrementTest();
	printf("%d\n",increment() - 1);//此值为incrementTest()里产生的随机数
	system("pause");
	return 0;
}