Loops.java

import java.io.*;
import java.util.*;

public class Loops {
    public int fact(int n) {
	if (n == 1) {
	    return n;
	}
	else {
	    return n * fact(n-1);
	}
    }

    public int fact2(int n) {
	int ans = 1;
	while (n > 0) {
	    ans = ans * n;
	    n = n - 1;
	    }
	return ans;
	    }

    public int gcd(int a, int b) {
	int c = Math.min(a,b);
	while (c > 0) {
	    if (a%c==0 && b%c ==0) {
		return c;
	    }
	    else {
		c = c - 1;
		    }
	}
	return c;
    }
    
    public int gcd2(int a, int b) {
        int c = Math.min(a,b);
	int d = Math.max(a,b);
	while (c != 0) {
	    return gcd2(c,d%c);
		}
	return d;
	    }

    public boolean isPrime(int n) {
        int f = n - 1;
	while (f > 1) {
	    if (n%f == 0) {
		return false;
	    }
	    else {
		f = f - 1;
		    }
	}
	return true;
	    }
}