递归算法-阶乘

#ifndef __JIECHENG_H__
#define __JIECHENG_H__
/*
*
*
*阶乘
*
*
*
*/
int JieChen(int n)
{
	if (0 == n)
	{
		return 1;
	}
	else
	{
		return n*JieChen(n-1);
	}
}
#endif

工程文件

#include "DirectInsertSort.h"
#include "BubbSort.h"
#include "CHelper.h"
#include "SelectSort.h"
#include "jeicheng.h"
#include <iostream>
#include <exception>
#include <Windows.h>
using namespace std;
int main()
{
	CHelper myhelp;
	//try
	{
		myhelp.Show();
		int iopt = myhelp.GetInput();
		if(0 == iopt)
		{
			cout<<"您选择了0，那就是退出，拜拜,3秒后退出"<<endl;
			Sleep(3000);
			return 0;
		}
		
		int ArrayTest[10]={10,2,5,3,8,9,6,12,23,10};
		/*cout<<"原始数组是："<<endl;
		for (int i = 0;i<sizeof(ArrayTest)/sizeof(int);i++)
		{
		cout<<ArrayTest[i]<<",";
		}*/
		cout<<endl;
		switch(iopt)
		{
		case 1:
			{
				cout<<"排序后的数组是:"<<endl;
				CDirectInsertSort<int> cDirectInsert;
				cDirectInsert.DirectInsertSort(ArrayTest,10,1);
				break;
			}
		case 2:
			{
				cout<<"排序后的数组是:"<<endl;
				CBubbSortTestL<int> cBubbSort;
				cBubbSort.BubbSort(ArrayTest,10);
				break;
			}
		case 3:
			{
				cout<<"选择排序后的数组是:"<<endl;
				CSelectSort<int> cSelectSort;
				cSelectSort.SelectSort(ArrayTest,10);
				break;
			}
		case 4:
			{
				cout<<"5的阶乘是"<<JieChen(5)<<endl;
				break;
			}
		}
		
		/*for (int i = 0;i<sizeof(ArrayTest)/sizeof(int);i++)
		{
			cout<<ArrayTest[i]<<",";
		}*/
		cout<<endl;
	/*	cDirectInsert.DirectInsertSort(ArrayTest,10,0);
		for (int i = 0;i<sizeof(ArrayTest)/sizeof(int);i++)
		{
			cout<<ArrayTest[i]<<",";
		}*/
	}
	Sleep(10000);
	return 0;
}