Binary Search
void binarySearch(int target){
sort();
int left = 0;
int right = MAX;
while (left <= right) {
int mid = left + (right - left) / 2;
if (sorted[mid] == target) {
cout << "Element found at " << mid << "in sorted array";
return;
} else if (sorted[mid] < target) {
left = mid + 1;
} else {
right = mid - 1;
}
}
cout << "Element not found" << endl;
}
Comments
Post a Comment