Quantcast
Channel: Arbitrary large unsigned integers - Code Review Stack Exchange
Browsing latest articles
Browse All 3 View Live

Answer by Quuxplusone for Arbitrary large unsigned integers

Looks like fairly clean code, but I see plenty of places it could be improved. Letting my eyes skim over it and stop on the weird bits...hugeint *hugeint_ladd_cutoverflow(size_t n, const hugeint *const...

View Article


Answer by vnp for Arbitrary large unsigned integers

Multiplication cries for optimization (e.g. Karatzuba or Toom-Cook)Division also can be optimized; given a fast multiplication a most straightforward approach is Newton-Raphson.The semantics of...

View Article


Arbitrary large unsigned integers

Edit: There's now a Follow-up question concerning more recent code.From time to time, you see a question over at Stack Overflow about calculating factorials, typically asking why the result soon gets...

View Article
Browsing latest articles
Browse All 3 View Live


<script src="https://jsc.adskeeper.com/r/s/rssing.com.1596347.js" async> </script>