Binary Search Visualizer

Binary Search is a more efficient search algorithm that repeatedly divides the search interval in half. It requires the list to be sorted.

Procedure Explanation.

×

public class BinarySearch {
    public static int binarySearch(int[] arr, int target) {
        int left = 0;
        int right = arr.length - 1;
        while (left <= right) {
            int mid = left + (right - left) / 2;
            if (arr[mid] == target) {
                return mid;
            } else if (arr[mid] < target) {
                left = mid + 1;
            } else {
                right = mid - 1;
            }
        }
        return -1;
    }
}

×

Time Complexity:

Best Case: O(1)

Average Case: O(log n)

Worst Case: O(log n)

×

Enter Target Value