Hi(adsbygoogle = window.adsbygoogle || []).push({});

I'm writing a BigNum library for Javascript and have come up with a multiplication algorithm which I think is pretty efficient (a modification of shift/add), but I don't understand O(log ...) notation, so don't really know how to compare my method with something like the Schönhage–Strassen algorithm which has a complexity of O(N log N log log N).

I've determined, that in the worst case, numbers of bit width w require w/2 iterations with my method. Each iteration performs a number of individual steps, but I don't know whether to count those sub steps, or only the iteration count.

Is w/2 enough to define efficiency? Or do I have to get more granular and define every bit manipulation?

Thanks for any help

**Physics Forums - The Fusion of Science and Community**

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Determining efficiency of multiplication algorithm

Loading...

Similar Threads - Determining efficiency multiplication | Date |
---|---|

Converting a DFA to efficient code? | Mar 11, 2018 |

Writing a function that determines if a number is perfect | Jan 23, 2016 |

Functionally Determined and 1NF | May 25, 2015 |

Using the Runge Kutta Method to determine mass | Mar 12, 2015 |

[FORTRAN] Determining Apoapsis + Periapsis (Astrophysics) | Mar 29, 2013 |

**Physics Forums - The Fusion of Science and Community**