বাইনারি সার্চ এলগোরিদম

#include <stdio.h>
int main()
{
    int n, x, left, mid, right, i, flag = 0;

    printf("Array Size ? : ");
    scanf("%d", &n);

    int arr[n];

    for(i = 0; i < n; i++){
        scanf("%d", &arr[i]);
    }

    printf("Number you want to search ? :");
    scanf("%d", &x);

    left = 0;
    right = n - 1;

    while(left <= right){

        mid = (left + right) / 2;

        if(arr[mid] == x){
            flag = 1;
            printf("Found.Position in Array is %d\n", mid);
            break;
        }

        if(arr[mid] < x){
            left = mid + 1;
        }

        if(arr[mid] > x){

            right = mid - 1;
        }
    }

    if(flag == 0){
        printf("Not Found\n");
    }


return 0;
}