binary search

import javax.swing.*;
import java.util.Scanner;

public class main {

    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        int search = scan.nextInt();
        int[] arr = {1, 3, 2, 34, 12, 21};
        sort(arr);
        int least = 0;
        int most = arr.length - 1;

        while (least <= most) {
            int middle = (least + most) / 2;
            if (arr[middle] == search) {
                System.out.print("Index is: " + middle);
                break;
            }
            if (search > arr[middle]) {
                least = middle + 1;
            }
            if (search < arr[middle]) {
                most = middle - 1;
            }
        }
    }

    public static void sort(int[] arr) {
        for (int i = 1; i <= arr.length; i++) {
            for (int j = 0; j < arr.length - 1; j++) {
                if (arr[j] > arr[j + 1]) {
                    int one = arr[j];
                    int two = arr[j + 1];
                    arr[j] = two;
                    arr[j + 1] = one;
                }
            }
        }
    }

}