RFR: 8334755: Asymptotically faster implementation of square root algorithm [v47]

[fabioromano1]

On Mon, 29 Jul 2024 16:50:32 GMT, Raffaello Giulietti <rgiulietti at openjdk.org> wrote:

> Also, I wonder if it wouldn't be simpler for `len` to represent the `int` length of the square root rather than the `int` length of the argument. It would be more consistent with the Bertot, Magaud, Zimmermann paper and might slightly simplify some later computation. But I'm not sure.

Maybe. I think rather that representing the length of the square root is a bit confusing, since in recursive algorithms it's a more common practice to use the length of the input as an argument...

-------------

PR Review Comment: https://git.openjdk.org/jdk/pull/19710#discussion_r1695663269