ADDITIONAL SYSTEM INFORMATION :
Java22.0.1 on kali linux
A DESCRIPTION OF THE PROBLEM :
I have implemented the Zimmermann's square root algorithm.
The algorithm is proved to be asymptotically faster than the Newton's Method, even for small numbers. To get an idea of how much the Newton's Method is slow, I compare Newton's Method with a version of classical square root algorithm that I implemented. After implementing Zimmermann's algorithm, it turns out that it is faster than my algorithm even for small numbers!
Java22.0.1 on kali linux
A DESCRIPTION OF THE PROBLEM :
I have implemented the Zimmermann's square root algorithm.
The algorithm is proved to be asymptotically faster than the Newton's Method, even for small numbers. To get an idea of how much the Newton's Method is slow, I compare Newton's Method with a version of classical square root algorithm that I implemented. After implementing Zimmermann's algorithm, it turns out that it is faster than my algorithm even for small numbers!
- relates to
-
JDK-8317764 java.math.BigInteger#sqrt is slower than necessary
-
- Closed
-
- links to
-
Commit(master)
openjdk/jdk/367e0a65
-
Review(master)
openjdk/jdk/19710