using System;

​

public class BinarySearchExample {

    public static int BinarySearch(int[] arr, int target) {

        int left = 0;

        int right = arr.Length - 1;

​

        while (left <= right) {

            int middle = left + (right - left) / 2;

            Console.WriteLine($"Middle index: {middle}");

​

            if (arr[middle] == target) {

                return middle; // target found at index middle

            } else if (arr[middle] < target) {

                left = middle + 1; // search in the right half

            } else {

                right = middle - 1; // search in the left half

            }

        }

​

        return -1; // target not found

    }

​

    public static void Main() {

        int[] sortedArray = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};

        int target = 7;

        int result = BinarySearch(sortedArray, target);

        if (result != -1) {

            Console.WriteLine($"Element found at index: {result}");

        } else {

            Console.WriteLine("Element not found in the array.");

        }

    }

}

​