Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- int binarySearch(int arr[], int l, int r, int x)
- {
- if (r >= l) {
- int mid = l + (r - l) / 2;
- if (arr[mid] == x)
- return mid;
- if (arr[mid] > x)
- return binarySearch(arr, l, mid - 1, x);
- return binarySearch(arr, mid + 1, r, x);
- }
- return -1;
- }
- int main(void)
- {
- int n;
- cout << "Masukkan banyak data yang akan di input = "; cin >> n;
- int arr[n];
- cout << "Masukkan data = ";
- for(int i=0;i<n;i++)
- {
- cin >> arr[i];
- }
- int x;
- cout << "Masukkan data yang ingin di cari = ";
- cin >> x;
- int result = binarySearch(arr, 0, n - 1, x);
- (result == -1) ? cout << "Data yang di masukkan tidak ada"
- : cout << "Data yang di cari da pada array index ke = " << result;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement