X-Git-Url: https://git.llucax.com/z.facultad/75.29/dale.git/blobdiff_plain/b81213323fe3a25ea2f5f1dd4f95c3800854bb43..adeca343a1a55fe3992722577268cf0aec4a5b65:/src/number.h

diff --git a/src/number.h b/src/number.h
index 4a52029..4b77f22 100644
--- a/src/number.h
+++ b/src/number.h
@@ -8,6 +8,7 @@
 #include <utility>
 #include <algorithm>
 #include <iterator>
+#include <stdint.h>
 
 /* sizeof(E) tiene que ser 2*sizeof(N); y son los tipos nativos con los cuales
  * se haran las operaciones mas basicas. */
@@ -273,7 +274,7 @@ std::pair< number< N, E >, number< N, E > > number< N, E >::split() const
 
 // es el algoritmo de división y conquista, que se llama recursivamente
 template < typename N, typename E >
-number < N, E > divide_n_conquer(number< N, E > u, number< N, E > v)
+number < N, E > karatsuba(number< N, E > u, number< N, E > v)
 {
 	typedef number< N, E > num_type;
 
@@ -296,9 +297,9 @@ number < N, E > divide_n_conquer(number< N, E > u, number< N, E > v)
 	// m = u1*v1
 	// d = u2*v2
 	// h = (u1+v1)*(u2+v2) = u1*u2+u1*v2+u2*v1+u2*v2
-	num_type m = divide_n_conquer(u12.first, v12.first);
-	num_type d = divide_n_conquer(u12.second, v12.second);
-	num_type h = divide_n_conquer(u12.first + v12.first,
+	num_type m = karastuba(u12.first, v12.first);
+	num_type d = karastuba(u12.second, v12.second);
+	num_type h = karastuba(u12.first + v12.first,
 			u12.second + v12.second);
 
 	// H-D-M = u1*u2+u1*v2+u2*v1+u2*v2 - u2*v2 - u1*v1 = u1*v2+u2*v1