binary search between two indexes

PrashantUnity answered on June 9, 2022 Popularity 1/10 Helpfulness 1/10

answer binary search between two indexes

binary search between two indexes

Comment

 int BinarySearch(int[] arr, int low, int high, int key)
 {
     while (low <= high)
     {
         int mid = low + (high - low) / 2;
         int midVal = arr[mid];

        if (midVal < key) low = mid + 1;
        else if (midVal > key) high = mid - 1;
        else if (midVal == key) return mid;
    }
    return -1;
}

Popularity 1/10 Helpfulness 1/10 Language csharp

Source: Grepper

Tags: between binary-search c#

Link to this answer
Share Copy Link

Contributed on Jun 09 2022

PrashantUnity

0 Answers Avg Quality 2/10

Continue with Google

By continuing, I agree that I have read and agree to Greppers's Terms of Service and Privacy Policy.

binary search between two indexes

Contents

More Related Answers

binary search between two indexes

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.