C# Binary Search

Program.cs

int[] nums = { 33, 44, 55, 66, 77, 88, 99, 100 };

int index = BinarySearch(nums, 99);
Console.WriteLine(index);

int BinarySearch(int[] nums, int target)
{

    int low = 0, high = nums.Length - 1;

    while (low <= high)
    {
        int midpoint = (low + high) / 2;

        if (nums[midpoint] == target)
        {
            return midpoint;
        }

        if (target < nums[midpoint])
        {
            high = midpoint - 1;
        }
        else
        {
            low = midpoint + 1;
        }
    }

    return -1;

}