summaryrefslogtreecommitdiffstats log msg author committer range
diff options
 context: 12345678910152025303540 space: includeignore mode: unifiedssdiffstat only
author committer H. Peter Anvin 2007-10-12 14:42:41 -0700 H. Peter Anvin 2007-10-12 14:42:41 -0700 450cb03f088f80c7f9665cb317f82594da3f379e (patch) 2460acc6820dd7a2e3ca6a521b8c7d5710c795e7 0cd74bdefb565f90a7f8fe91c377dab5af436bb1 (diff) pbn-450cb03f088f80c7f9665cb317f82594da3f379e.tar.gzpbn-450cb03f088f80c7f9665cb317f82594da3f379e.tar.xzpbn-450cb03f088f80c7f9665cb317f82594da3f379e.zip
pbn_div: update comment (statement of intent, no implementation yet)
-rw-r--r--pbn_div.c7
1 files changed, 6 insertions, 1 deletions
 diff --git a/pbn_div.c b/pbn_div.cindex 6c169ac..b9ee448 100644--- a/pbn_div.c+++ b/pbn_div.c@@ -18,7 +18,12 @@ The sign on the outputs = sign(numerator) XOR sign(denominator) - Returns -1 on error (divide by zero) and frees the inputs */+ Returns -1 on error (divide by zero) and frees the inputs.++ This is a "basecase" division and so is O(n^2) -- it assumes that+ the numbers we have to deal with aren't all that large. For really+ large numbers, we need a subquadratic algorithm like+ divide-and-conquer or Newton-Rhapson division. */ #include "pbn.h"