文件名称:Large-integer-factorial
下载
别用迅雷、360浏览器下载。
如迅雷强制弹出,可右键点击选“另存为”。
失败请重下,重下不扣分。
如迅雷强制弹出,可右键点击选“另存为”。
失败请重下,重下不扣分。
介绍说明--下载内容均来自于网络,请自行研究使用
本实例实现了一个计算大整数阶乘的程序。通常使用递归来计算一个整数的阶乘。但是, 因为ii.算本身能够表示的最大整数是有限的,所以能够计算的阶乘整数要受到限制。本程序使 用数组来存储结果,因而很好地解决了这个问题,只要有足够大的数组就能计.任意大的整数0-Examples of the realization of a to calculate large integer factorial program. Usually use recursion to calculate the factorial of an integer. However, because ii. Largest integer that is limited by the operator itself can be represented, it is possible to calculate the factorial integer restrictions. This program uses an array to store the results, a good solution to this problem, as long as there is a sufficiently large array will be able to count arbitrarily large integer 0
(系统自动生成,下载前可以参看下载内容)
下载文件列表
Large integer factorial.c