74 lines
1.5 KiB
Java
74 lines
1.5 KiB
Java
|
|
/**
|
|
* Beschreiben Sie hier die Klasse Fakultät.
|
|
*
|
|
* @author (Ihr Name)
|
|
* @version (eine Versionsnummer oder ein Datum)
|
|
*/
|
|
public class Fakultät
|
|
{
|
|
|
|
public static int fak(int n) {
|
|
if( n == 1) return 1;
|
|
int ergebnis = n * fak(n-1);
|
|
return ergebnis;
|
|
|
|
}
|
|
public static int fibo(int n) {
|
|
if (n == 1) return 1;
|
|
if (n == 0) return 0;
|
|
return fibo(n-2) + fibo(n-1);
|
|
}
|
|
|
|
public static int binom(int n, int k){
|
|
if (k == 0) return 1;
|
|
if (k == n) return 1;
|
|
return binom(n-1, k-1) + binom (n-1, k);
|
|
}
|
|
public static void Array(){
|
|
double[] arr = new double[10];
|
|
for(int i = 0; i<arr.length; i++){
|
|
arr[i] = Math.random();
|
|
}
|
|
for (int i=0; i<arr.length; i++){
|
|
System.out.print(arr[i]);
|
|
|
|
}
|
|
|
|
double summe = 0;
|
|
for(int j = 0; j<arr.length; j++){
|
|
summe = summe + arr[j];
|
|
}
|
|
System.out.println("Summe:" + summe);
|
|
|
|
double min = arr[0];
|
|
for(int k=0; k<arr.length; k++){
|
|
if(min > arr[k]){
|
|
min = arr[k];
|
|
}
|
|
}
|
|
System.out.println("Minimum:" + min);
|
|
|
|
|
|
double max = arr[0];
|
|
for(int l=0; l<arr.length; l++){
|
|
if(max < arr[l]){
|
|
max = arr[l];
|
|
}
|
|
}
|
|
System.out.println("Maximum:" + max);
|
|
|
|
|
|
for(int z = 0; z == arr.length; z++){
|
|
|
|
|
|
|
|
}
|
|
|
|
}
|
|
//Minumun suchen
|
|
|
|
}
|
|
|
|
|