Added Iterative and Recursive Binary Search in Java (#19219)
Code for Iterative and Recursive Binary Search has been appended. Thanx !
This commit is contained in:
committed by
Quincy Larson
parent
fb80ec288e
commit
fac8e975dd
@ -302,6 +302,38 @@ func binarySearch(for number: Int, in numbers: [Int]) -> Int? {
|
||||
}
|
||||
return nil // the given number was not found
|
||||
}
|
||||
```
|
||||
### Example in Java
|
||||
```Java
|
||||
// Iterative Approach in Java
|
||||
int binarySearch(int[] arr, int start, int end, int element)
|
||||
{
|
||||
while(start <= end)
|
||||
{
|
||||
int mid = ( start + end ) / 2;
|
||||
if(arr[mid] == element)
|
||||
return mid;
|
||||
if(arr[mid] < element)
|
||||
start = mid+1;
|
||||
else
|
||||
end = mid-1;
|
||||
}
|
||||
return -1;
|
||||
}
|
||||
```
|
||||
```Java
|
||||
// Recursive Approach in Java
|
||||
int binarySearch(int[] arr, int start,int end , int element)
|
||||
{
|
||||
int mid = ( start + end ) / 2;
|
||||
if(arr[mid] == element)
|
||||
return mid;
|
||||
if(arr[mid] < element)
|
||||
return binarySearch( arr , mid + 1 , end , element );
|
||||
else
|
||||
return binarySearch( arr, start, mid - 1 , element);
|
||||
}
|
||||
|
||||
```
|
||||
|
||||
### More Information
|
||||
|
Reference in New Issue
Block a user