int main()
{
int n3 = 10000000;
int* arr3 = Myutil::generateorderarray(n3);
clock_t starttime3 = clock();
int j =MyAlgorithmTester::binarysearch(arr3,n3,188888);

clock_t endtime3 = clock();
cout << "binarysearchtime" << double(endtime3 - starttime3) / CLOCKS_PER_SEC << "s" << endl;
delete []arr3;
return 0;

}

namespace MyAlgorithmTester {
int binarysearch(int arr[], int n, int target)
{
int l = 0; int r = n - 1;
while (l <= r)
{
int mid = l + (r - l) / 2;
if (arr[mid] == target)
return mid;
if(arr[mid] > target)
{
r = mid - 1;
}
else
{
l = mid+1;
}
}
return -1;
}
};