Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
binary square root
import java.util.*; import java.lang.*; class Rextester { public static void main(String args[]) { double wert=double.parseDouble(args[0]); } public static double sucheWurzel(double x) { if (x < 0) return Double.NaN; else return sucheWurzel(x,0 , x < 1 && x > 0 ? 1 : x);//, 0.000001); } public static double sucheWurzel(double x, double a, double e) {//, double eps) { System.out.println("e="+e); double m = (a + e) / 2; // Wert genau genug, Double-Wert ändert sich nicht mehr if (a == m || e == m) { return m; } // Genauigkeitstoleranz eps //if (Math.abs(m*m - x) <= eps) // return m; // Wert zu groß if (x < m*m) return sucheWurzel(x, a, m);//, eps); // Wert zu klein else return sucheWurzel(x, m, e);//, eps); } }
run
|
edit
|
history
|
help
0
Invert sign and add
Kochergina_1
Java Q4
A
MyBirdClass
motifCatur
LRU cache - Using doubly linked list (Fast!)
Binary Tree ZigZag Traversal
// Java Coding Challenge - 09: Find out duplicate numbers using HashSet
Java # Dizi ile ek bulma