Nulování poloviny pole
September 18, 2007 v 9:07 pm public static void nulovani(int [] [] pole) {
int i;
int j;
i = 0;
while (i < pole.length) {
j = 0;
while (j <= i) {
pole[i][j] = 0;
j = j+1;
}
i = i+1;
}
}
Faktorial rekurzí
v 9:05 pm public static double faktorial(double x) {
if (x == 0) return 1;
else
return x * faktorial(x – 1);
}
public static double faktorial2(double x, double tmp) {
if (x == 0) return tmp;
else
return faktorial2(x-1, x*tmp);
}