代表的なアルゴリズム

package week9;

    public class Algorithm {
        public static void main(String[] args) {

        int c[] = { 6, 2, 9, 34, 66, 12, 7, 11, 14, 4, 34, 67 };
        printArray(sort1(c));
        int e[] = { 6, 2, 9, 34, 66, 12, 7, 11, 14, 4, 34, 67 };
        printArray(sort2(e));

        int d[] = { 2, 4, 6, 7, 9, 11, 12, 14, 34, 39, 66, 67, 89 };
        System.out.println(search2(d, 2));
        System.out.println(search2(d, 4));
        System.out.println(search2(d, 6));
        System.out.println(search2(d, 7));
        System.out.println(search2(d, 9));
        System.out.println(search2(d, 11));
        System.out.println(search2(d, 12));
        System.out.println(search2(d, 14));
        System.out.println(search2(d, 34));
        System.out.println(search2(d, 66));
        System.out.println(search2(d, 67));
        System.out.println(search2(d, 5));
        System.out.println(search2(d, 21));
        System.out.println(search2(d, 167));
    }

    static int[] sort1(int[] array) {
        for (int i = 0; i < array.length - 1; i++) {
            int candidate = i;
            for (int j = i + 1; j < array.length; j++) {
                if (array[candidate] < array[j]) {
                    candidate = j;
                }
            }
            int temp = array[candidate];
            array[candidate] = array[i];
            array[i] = temp;
        }
        return array;
    }

    static int[] sort2(int[] array) {
        for (int i = array.length ; i > 1; i--) {
            for (int j = 0; j < i - 1; j++) {
                if (array[j+1] < array[j]) {
                    int temp = array[j+1];
                    array[j+1] = array[j];
                    array[j] = temp;
                }
            }
        }
        return array;
    }

    static int search1(int[] array, int q) {
        for (int i = 0; i < array.length; i++) {
            if (array[i] == q) {
                return i;
            }
        }
        return -1;
    }

    static int search2(int[] array, int q) {
        int index;
        int start = 0, end = array.length - 1;
        while (start <= end) {
            index = ( start + end ) / 2;
            if (array[index] == q) {
                return index;
            } else if (array[index] < q) {
                start = index + 1;
            } else {
                end = index - 1;
            }
        }
        return -1;
    }

    static void printArray(int[] array) {
        for (int i = 0; i < array.length; i++) {
            if (i != 0) {
                System.out.print(" ,");
            }
            System.out.print(array[i]);
        }
        System.out.println();
    }
}