binary search
📝 C
carriecruz467
· 19d ago
This snippet efficiently finds the position of a target value within a sorted array by repeatedly dividing the search interval in half.
C
int binarysearch(int arr[], int size, int target) { int left = 0, right = size - 1; while (left <= right) { int mid = left + (right - left) / 2; if (arr[mid] == target) return mid; else if (arr[mid] < target) left = mid + 1; else right = mid - 1; } return -1;
}
Comments