Compute factorial of any arbitratily large number/.
More...
#include <cstring>
#include <ctime>
#include <iostream>
#include "./large_number.h"
Compute factorial of any arbitratily large number/.
- Author
- Krishna Vedala
- See also
- factorial.cpp
◆ main()
int main |
( |
int |
argc, |
|
|
char * |
argv[] |
|
) |
| |
Main program
93 number =
atoi(argv[1]);
95 std::cout <<
"Enter the value of n(n starts from 0 ): ";
102 for (i = 2; i <= number; i++)
106 static_cast<double>(end_time - start_time) / CLOCKS_PER_SEC;
◆ test1()
Test implementation for 10! Result must be 3628800.
- Returns
- True if test pass else False
19 unsigned int i, number = 10;
21 for (i = 2; i <= number; i++)
24 const char *known_reslt =
"3628800";
34 for (i = 0; i < N; i++) {
36 std::cerr << i <<
"^th digit mismatch! " << known_reslt[i]
◆ test2()
Test implementation for 100! The result is the 156 digit number:
9332621544394415268169923885626670049071596826438162146859296389521759
9993229915608941463976156518286253697920827223758251185210916864000000
000000000000000000
- Returns
- True if test pass else False
56 unsigned int i, number = 100;
58 for (i = 2; i <= number; i++)
61 const char *known_reslt =
62 "9332621544394415268169923885626670049071596826438162146859296389521759"
63 "9993229915608941463976156518286253697920827223758251185210916864000000"
74 for (i = 0; i < N; i++) {
76 std::cerr << i <<
"^th digit mismatch! " << known_reslt[i]