]> granicus.if.org Git - python/commit
k_mul() and long_mul(): I'm confident that the Karatsuba algorithm is
authorTim Peters <tim.peters@gmail.com>
Mon, 12 Aug 2002 17:36:03 +0000 (17:36 +0000)
committerTim Peters <tim.peters@gmail.com>
Mon, 12 Aug 2002 17:36:03 +0000 (17:36 +0000)
commitd64c1def7ca69e346bade11f2a99651eb8e2ff35
tree6c2f540c804be7f24f9c3ae0daca6368aeab4ab8
parenta6fa0e6f2e0e2df20b008f3e5c5b0be25a0516de
k_mul() and long_mul():  I'm confident that the Karatsuba algorithm is
correct now, so added some final comments, did some cleanup, and enabled
it for all long-int multiplies.  The KARAT envar no longer matters,
although I left some #if 0'ed code in there for my own use (temporary).
k_mul() is still much slower than x_mul() if the inputs have very
differenent sizes, and that still needs to be addressed.
Misc/NEWS
Objects/longobject.c