int binarySearchRecursive(int A[], int start, int end, int target)
{
if (start == end && A[start] != target)
return -1;
int mid = start + (end - start)/2;
if (A[mid] < target)
return binarySearchRecursive(A, mid + 1, end, target);
else if (A[mid] > target)
return binarySearchRecursive(A, start, mid - 1, target);
else
return mid;
}
bool binarySearchRecursive(int list[], int first, int end, int item){
int middle = (first + end)/2;
if(list[middle] == item){
return true;
}
if(first >= end){
return false;
}
if(list[middle] < item){
return binarySearchRecursive(list, middle+1, end, item);
} else {
return binarySearchRecursive(list, first, middle-1, item);
}
}
int binarySearchRecursive(int arr[], int left, int right, int data)
{
if (right >= left)
{
int mid = left + (right - left)/2;
// If the element is present at the middle itself
if (arr[mid] == data) return mid;
// If element is smaller than mid, then it can only be present
// in left subarray
if (arr[mid] > data) return binarySearchRecursive(arr, left, mid-1, data);
// Else the element can only be present in right subarray
return binarySearchRecursive(arr, mid+1, right, data);
}
// We reach here when element is not present in array
return NOELEMENT;
}
int main(int argc, char const *argv[]){
int size, value, option;
bool find;
srand(time(0));
size = (rand()%100)+1;
int *list = new int[size];
for(int i = 0; i < size; i++){
list[i] = (rand()%100)+1;
}
value = (rand()%100);
option = 0;
switch (option) {
case 0:
{
auto start = std::chrono::steady_clock::now();
find = binarySearchIterative(list, 0, size-1, value);
auto end = std::chrono::steady_clock::now();
auto diff = end - start;
if(find)
{
std::cout << "You find the element using the binary search iterative." << std::endl;
}
else{
std::cout << "You not find the element using the binary search iterative." << std::endl;
}
std::cout << "And the time of search was " << std::chrono::duration <double, std::milli> (diff).count() << " ms." << std::endl;
}
break;
case 1:
{
auto start = std::chrono::steady_clock::now();
find = binarySearchRecursive(list, 0, size-1, value);
auto end = std::chrono::steady_clock::now();
auto diff = end - start;
if(find)
{
std::cout << "You find the element using the binary search recursive." << std::endl;
}
else{
std::cout << "You not find the element using the binary search recursive." << std::endl;
}
std::cout << "And the time of search was " << std::chrono::duration <double, std::milli> (diff).count() << " ms." << std::endl;
}
break;
default:
std::cout << "This isn't a valid option, please restart the program." << std::endl;
break;
}
option = 1;
switch (option) {
case 0:
{
auto start = std::chrono::steady_clock::now();
find = binarySearchIterative(list, 0, size-1, value);
auto end = std::chrono::steady_clock::now();
auto diff = end - start;
if(find)
{
std::cout << "You find the element using the binary search iterative." << std::endl;
}
else{
std::cout << "You not find the element using the binary search iterative." << std::endl;
}
std::cout << "And the time of search was " << std::chrono::duration <double, std::milli> (diff).count() << " ms." << std::endl;
}
break;
case 1:
{
auto start = std::chrono::steady_clock::now();
find = binarySearchRecursive(list, 0, size-1, value);
auto end = std::chrono::steady_clock::now();
auto diff = end - start;
if(find)
{
std::cout << "You find the element using the binary search recursive." << std::endl;
}
else{
std::cout << "You not find the element using the binary search recursive." << std::endl;
}
std::cout << "And the time of search was " << std::chrono::duration <double, std::milli> (diff).count() << " ms." << std::endl;
}
break;
default:
std::cout << "This isn't a valid option, please restart the program." << std::endl;
break;
}
delete[] list;
return 0;
}
