#include using namespace std; void swap(int *x, int *y); void bubbleSort(int arr[], int n); int binarySearch(int arr[], int l, int r, int x) ; int main() { int n; // size of array //cout<<"Enter the size of array: "; cin>>n; int arr[n]; //cout<<"Enter the elements of array separated by spaces: \n"; for(int i=0;i>arr[i]; } int x; //cout<<"Enter the element that have to be searched: "; cin>>x; bubbleSort(arr,n); cout<<"Sorted Array: "; for(int i=0;i arr[j+1]){ swap(&arr[j], &arr[j+1]); } } } } // function for implementing Binary Search // Here l and r are leftmost and rightmost index of array, we will update these as we do recurssion on small part of array each time // x is the element that we are searching for int binarySearch(int arr[], int l, int r, int x) { if (r >= l) { int mid = l + (r - l) / 2; // If the element is present at the middle itself if (arr[mid] == x) return mid; // If element is smaller than mid, then // it can only be present in left subarray if (arr[mid] > x) return binarySearch(arr, l, mid - 1, x); // Else the element can only be present // in right subarray return binarySearch(arr, mid + 1, r, x); } // when element is not present in array return -1; } /* Binary Search is a type of Divide and Conquer algorithms. Unlike linear search which takes O(n) time for search an array of size n, Binary Search only takes O(log n) time that's much faster than linear search. One disadvantage of Binary Search is it only works on sorted array that's why here we bubbleSort to sort the Array.*/

Binary Search In Array