From c3136e280a5a8603c189ff6ab933a4b7eb80a160 Mon Sep 17 00:00:00 2001 From: Stepfen Shawn Date: Thu, 30 Jul 2020 23:18:29 +0800 Subject: [PATCH] Update and rename Perfect BinarySearch to PerfectBinarySearch.java --- Searches/Perfect BinarySearch | 21 ------------------- Searches/PerfectBinarySearch.java | 34 +++++++++++++++++++++++++++++++ 2 files changed, 34 insertions(+), 21 deletions(-) delete mode 100644 Searches/Perfect BinarySearch create mode 100644 Searches/PerfectBinarySearch.java diff --git a/Searches/Perfect BinarySearch b/Searches/Perfect BinarySearch deleted file mode 100644 index 28cdcb5be..000000000 --- a/Searches/Perfect BinarySearch +++ /dev/null @@ -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; - } - diff --git a/Searches/PerfectBinarySearch.java b/Searches/PerfectBinarySearch.java new file mode 100644 index 000000000..03f06dfa2 --- /dev/null +++ b/Searches/PerfectBinarySearch.java @@ -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; + } +}