IN WORK
Alles anzeigen
Quellcode
- public class A1_Binomialkoeffizient {
- /**
- * @param args
- */
- public static void main(String[] args) {
- // TODO Auto-generated method stub
- int x=2, y=4;
- System.out.println("Produkt: "+prod(x,y));
- System.out.println("Produkt: "+prod_r(x,y));
- System.out.println("Fakultät: " +fac(x));
- System.out.println("Fakultät: " +fac_r(x));
- System.out.println("Binom 1: " +binom1(y,x));
- System.out.println("Binom 2: " +binom2(y,x));
- }
- static int prod(int m, int n) {
- if(m >n)
- return -1;
- int prod=m;
- do {
- m++;
- prod *=m;
- } while(m < n);
- return prod;
- }
- static int prod_r(int m, int n) {
- if(m > n)
- return -1;
- if(m == n-1)
- return m*n;
- else
- return m*prod_r(++m, n);
- }
- static int fac(int n) {
- int fac = n;
- while(n > 1) {
- n--;
- fac *= n;
- }
- return fac;
- }
- static int fac_r(int n) {
- if(n == 0)
- return 1;
- return n*fac_r(--n);
- }
- static int binom1(int m, int n) {
- if(m < n)
- return 0;
- return fac(m) / (fac(n) * fac(m-n));
- }
- static int binom2(int m, int n) {
- return prod(n,m) * (m-n+1) / fac(n);
- }
- }