cppBinarySearchNew

#include <iostream>

int main()
{
    const int arrSize{ 10 };
    //int arr[arrSize]{ 6,1,4,2,8,9,11,3,2,1 };
    int arr[arrSize]{ 1,1,2,2,3,4,6,8,9,11};
    int key{ -99 };

    int left{0};
    int right{arrSize - 1};
    int mid;

    bool found{false};

    while (left < right and !found)
    {
        mid = (left + right) / 2;
        if (key == arr[mid]) { found = true; }
        if (key > arr[mid]) { left = mid + 1; std::cout << "Right side...\n"; }
        if (key < arr[mid]) { right = mid - 1; std::cout << "Left side...\n"; }
    }

    if (found)
    {
        std::cout << "Found!\n";
    }
    else
    {
        std::cout << "NOT Found!\n";
    }

    return 0;
}