
Untitled
By: a guest on
May 30th, 2012 | syntax:
Java | size: 0.50 KB | hits: 16 | expires: Never
public class PiBerechnenAnwendung {
public static void main(String args[]){
int k = 1000;
System.out.printf("%1.15f\n", rekursion(k));
}
private static double rekursion(int tiefe) {
if (tiefe >= 0) {
return ( (1/Math.pow(16,tiefe))*( (4/(8*(double)tiefe+1)) - (2/(8*(double)tiefe+4)) - (1/(8*(double)tiefe+5)) - (1/(8*(double)tiefe+6)) ) + rekursion(tiefe-1) ) ;
} else {
return 0;
}
}
}