int getSuperior(int s1, int s2, const char *n1, const char *n2)
{
int size = 1, ret;
while (size < s1 && !(ret = isBigger(n1, n2, size, s2)))
size++;
return size;
}
void bigDivide(char num1[] , char num2[] , char quot[])
{
if(strcmp(num1 , "0") == 0)
{
quot[0] = '0';
quot[1] = '\0';
return;
}
char *temp = (char*)malloc(sizeof(char) * strlen(num1));
int len1 = strlen(num1);
int i;
int j = 0;
for( i = 0 ; i < len1 ; i++)
{
temp[j] = num1[len1-i-1];
temp[j+1] = '\0';
reverseStr(temp);
int cnt = 0;
while(isBigger(temp , num2))
{
bigSub(temp, num2);
cnt++;
}
reverseStr(temp);
quot[i] = cnt + '0';
if(strcmp(temp, "0") == 0)
{
j = 0;
}
else
{
j++;
}
}
quot[i] = '\0';
removeFrontZero(quot);
reverseStr(quot);
free(temp);
}
bool Function::isBiggerEqual(double a, double b, double offset)
{
return isBigger(a, b, offset) || isEqual(a, b, offset);
}
