Long multiplication: Difference between revisions

Content added Content deleted

Inline

@@ Line 408: / Line 408: @@
 #define X(V,L,I) ( ((I)<(L)) ? (V[(L)-(I)-1]-'0') : 0)
 #define MIN(A,B) ( ((A)<(B)) ? (A) : (B) )
-char *longmolt(const char *a, const char *b)
+char *longmult(const char *a, const char *b)
 {
   int n, m, T;
   char *r = NULL;
-  int i, j, k, p;
+  int i, j, k;
   int *C, *R;
@@ Line 459: / Line 459: @@
   /* printf("%s * %s = 340282366920938463463374607431768211456\n", n1, n1); */
-  res = longmolt(n1,n1);
+  res = longmult(n1,n1);
   for(lz=0; (lz < strlen(res)) && (res[lz]=='0') ;lz++) ;
   printf("%s * %s = %s\n", n1, n1, res+lz);