algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-07-10 21:43:15 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update and rename Perfect BinarySearch to PerfectBinarySearch.java

Browse Source
This commit is contained in:
Stepfen Shawn
2020-07-30 23:18:29 +08:00
committed by GitHub
parent 2890797194
commit c3136e280a
2 changed files with 34 additions and 21 deletions
Download Patch File Download Diff File Expand all files Collapse all files

21
Searches/Perfect BinarySearch
View File

@ -1,21 +0,0 @@
static int binarySearch(int[] arr, int target) {
int low = 0 ;
int high = arr.length - 1 ;
while(low <= high) {
int mid =(low + high) / 2;
if(arr[mid] == target) {
return mid;
}
else if(arr[mid] > target) {
high = mid - 1;
}
else {
low = mid + 1;
}
}
return -1;
}

34
Searches/PerfectBinarySearch.java Normal file
View File

@ -0,0 +1,34 @@
import java.util.*;
class PerfectBinarySearch{
static int binarySearch(int[] arr, int target)
{
int low = 0 ;
int high = arr.length - 1 ;
while(low <= high) {
int mid =(low + high) / 2;
if(arr[mid] == target) {
return mid;
}
else if(arr[mid] > target) {
high = mid - 1;
}
else {
low = mid + 1;
}
}
return -1;
}
public static void main(String[] args)
{
PerfectBinarySearch BinarySearch = new PerfectBinarySearch();
int[] array = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
assert BinarySearch.binarySearch(array, -1) == -1;
assert BinarySearch.binarySearch(array, 11) == -1;
}
}