package labone.insertionsort;

public class Driver {

    public static void main(String[] args) {
        int n;
        int key;
        for (int power = 1; power < 26; power++){
            n = (int) Math.pow(2, power);
            int[] array = new int[n];
            for (int i = 0; i < array.length; i++) {
                array[i] = (int) (Math.random() * n + 1);
            }
            key = (int) (Math.random() * (Math.pow(2, power) + 1));
            System.out.println("The key on iteration " + power + " is "
                    + key + ".");

            timeInitial = System.currentTimeMillis();
            System.out.println("timeInitial: " + timeInitial);
            InsertionSort.linearSearch(array, key);

            timeInitial = System.currentTimeMillis();
            System.out.println("timeInitial: " + timeInitial);
            InsertionSort.insertionSort(array);
            InsertionSort.binarySearch(array, key, 0, (n - 1));
            System.out.println();
        }
    }
    static long timeInitial;
    static long timeFinal;
    static long timeElapsed;
    protected static final long MILLI_TO_BASE = 1000;
}

@@ -993,24 +993,269 @@
 ;%0A        %7D%0A
+        n = 1000;%0A        int%5B%5D unsorted = new int%5B1000%5D;%0A        while(n %3E= 0) %7B%0A            unsorted%5Bn%5D = n;%0A            n--%0A        %7D%0A        InsertionSort.linearSearch(unsorted);%0A        InsertionSort.binnarySearch(unsorted, key, 0, (n-1));%0A
     %7D%0A    st

Update Driver.java