**diff options**

author | H. Peter Anvin <hpa@zytor.com> | 2007-10-12 14:42:41 -0700 |
---|---|---|

committer | H. Peter Anvin <hpa@zytor.com> | 2007-10-12 14:42:41 -0700 |

commit | 450cb03f088f80c7f9665cb317f82594da3f379e (patch) | |

tree | 2460acc6820dd7a2e3ca6a521b8c7d5710c795e7 | |

parent | 0cd74bdefb565f90a7f8fe91c377dab5af436bb1 (diff) | |

download | pbn-450cb03f088f80c7f9665cb317f82594da3f379e.tar.gz pbn-450cb03f088f80c7f9665cb317f82594da3f379e.tar.xz pbn-450cb03f088f80c7f9665cb317f82594da3f379e.zip |

pbn_div: update comment (statement of intent, no implementation yet)

-rw-r--r-- | pbn_div.c | 7 |

1 files changed, 6 insertions, 1 deletions

@@ -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" |