Aktiver Arbeitgeber
Implement java's pow function
Anonym
Fast exponentiation: (I think this runs in order of O(log n), not sure though) static double fast_pow (double val, double n){ if (n==0) return 1; int x = fast_pow (val, n/2); x = x*x; if (n%2) x = x*val; return x; }