|
nt j;
int k = 0;
for (int i = MAX_SIZE-1; i >= 0; i--){
j = bigInt1[i] + bigInt2[i] + k;
k=0;
if (j >= 10){
k = 1;
j = j-10;
}
bigInt3[i] = j;
}
}
void multiplication(BigIntType & bigInt1, BigIntType & bigInt2, BigIntType & bigInt3) {
int i;
int k= 0;
int prod;
int m=0;
BigIntType bigInt10;
fo
|
|
|
big that Integer or double(etc..) type can not save that value.
The recursive function needs two fundamental rules.
1. Base Case which can be solved without recursion. S(0)=0 is base case in this problem
2. Making Progress. The recursive function call must always be to case that makes progress to
|
|
메뉴펼치기
