public static void selectionSort(int[] arr) {
    int minIdx = 0;
    int min = arr[minIdx];

    //Find smallest idx
    for (int i = 0; i < arr.length; i++) {
        minIdx = i;

        for (int j = i; j < arr.length; j++) {
            if (arr[j] < arr[minIdx]) {
                minIdx = j;
            }
        }

        //Swap beginning of unsorted part with minimum
        int temp = arr[minIdx];
        arr[minIdx] = arr[i];
        arr[i] = temp;
    }
}

public static void insertionSort(int[] arr) {
    for (int i = 1; i < arr.length; i++) {
        int key = arr[i];
        int idx = i;
        while(idx > 0 && key < arr[idx-1]) {
            arr[idx] = arr[idx-1];
            idx--;
        }

        arr[idx] = key;
    }
}

public static int binarySearch(int[] arr, int target) {
    int start = 0;
    int end = arr.length-1;

    while (start <= end) {
        int mid = (start+end)/2;

        if (target == arr[mid]) {
            return mid;
        }

        if (target < arr[mid]) {
            end = mid - 1;
        }

        if (target > arr[mid]) {
            start = mid + 1;
        }
    }

    return -1;
}