Question

************************CODE SHOULD BE WRITTEN IN C++***************************

TASK:

"Given a sorted array of String and a String x, find index of x if it is present in the array."

*************************USE THE FUNCTION***********************************************************************

#include "problem2.h"

// Return index of x if it is present in arr[],
// else return -1
int binarySearch(char* arr[], char* x, int n)
{
//WRITTEN CODE

return -1;
}

******************************EXAMPLE******************************************************************************

Input :  arr[] = { "contribute", "geeks", "ide", "practice"}, x = "ide"
Output :  2
The String x is present at index 2.

Input :  arr[] = { "contribute", "geeks", "ide", "practice"}, x = "zz"
Output :  -1
The String "zz" is not present.

Answer 1

int binarySearch(char* arr[], char* x, int n)
{
    int left = 0, right = n-1, mid;
    while(left <= right) {
        mid = (left + right) / 2;
        if(strcmp(arr[mid], x) == 0) {
            return mid;
        } else if(strcmp(arr[mid], x) > 0) {
            right = mid-1;
        } else {
            left = mid+1;
        }
    }
    return -1;
}