java craps >:(

public class assignment1 {
    public static long[] times = new long[6];
    public static void alg1(int n) {
        times[0] = System.currentTimeMillis();
        int sum = 0;
        for( int i = 0; i < n; i++ )
            sum++;
        times[0] = System.currentTimeMillis() - times[0];

    }
    public static void alg2(int n) {
        times[1] = System.currentTimeMillis();
        int sum = 0;
        for( int i = 0; i < n; i++ )
            for( int j = 0; j < n; j++ )
                sum++;
        times[1] = System.currentTimeMillis() - times[1];
    }
    public static void alg3(int n) {
        times[2] = System.currentTimeMillis();
        int sum = 0;
        for( int i = 0; i < n; i++ )
            for( int j = 0;j<n * n; j++ )
                sum++;
        times[2] = System.currentTimeMillis() - times[2];
    }
    public static void alg4(int n) {
        times[3] = System.currentTimeMillis();
        int sum = 0;
        for( int i = 0; i < n; i++ )
            for( int j = 0; j < i; j++ )
                sum++;
        times[3] = System.currentTimeMillis() - times[3];
    }
    public static void alg5(int n) {
        times[4] = System.currentTimeMillis();
        int sum = 0;
        for( int i = 0; i < n; i++ )
            for( int j = 0;j<i * i; j++ )
                for( int k = 0; k < j; k++ )
                    sum++;
        times[4] = System.currentTimeMillis() - times[4];
    }
    public static void alg6(int n) {
        times[5] = System.currentTimeMillis();
        int sum = 0;
        for( int i = 1; i < n; i++ )
            for( int j = 1;j<i * i; j++ )
                if( j % i == 0 )
                    for( int k = 0; k < j; k++ )
                        sum++;
        times[5] = System.currentTimeMillis() - times[5];
    }
    public static boolean alg7(int X, int[][] matrix) {
        for (int i = 0 ; i < matrix[0].length; i++) {
            if (matrix[i][0] < X) {
                for (int j = 0 ; j < matrix[0].length; i++) {
                    if (matrix[i][j] > X) {
                        break;
                    }
                    if (matrix[i][j] == X) {
                        return true;
                    }
                }
            }
        }
        return false;
    }
    public static void main(String[] args) {
        System.out.println("It took this many milliseconds for each algorithm to run:");
        alg1(100000);
        System.out.println("Algorithm 1:" + times[0]);
        alg2(100000);
        System.out.println("Algorithm 2:" + times[1]);
        alg3(100000);
        System.out.println("Algorithm 3:" + times[2]);
        alg4(100000);
        System.out.println("Algorithm 4:" + times[3]);
        alg5(100000);
        System.out.println("Algorithm 5:" + times[4]);
        alg6(100000);
        System.out.println("Algorithm 6:" + times[5]);
    }
}