Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- int binarySearch(int arr[], int n, int x) {
- int left = 0;
- int right = n - 1;
- while (left <= right) {
- int mid = left + (right - left) / 2;
- if (arr[mid] == x) {
- return mid; // nilai ditemukan di tengah array
- } else if (arr[mid] < x) {
- left = mid + 1; // nilai yang dicari ada di sebelah kanan mid
- } else {
- right = mid - 1; // nilai yang dicari ada di sebelah kiri mid
- }
- }
- return -1; // nilai tidak ditemukan dalam array
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement