Classic binary search when sorted array is given

Antesh Sharma · Antesh Sharma · commit 86d07dd6742b · 2022-04-26T21:19:38.000+05:30
diff --git a/src/main/java/com/antesh/dsa/binarysearch/BinarySearch.java b/src/main/java/com/antesh/dsa/binarysearch/BinarySearch.java
@@ -19,6 +19,9 @@ public class BinarySearch {
     public static void main(String[] args) {
         int[] sortedArr = {10, 20, 30, 40, 50};
 
+        System.out.println(binarySearch(sortedArr,0, sortedArr.length-1, 10));
+        System.out.println(binarySearch(sortedArr,0, sortedArr.length-1, 30));
+        System.out.println(binarySearch(sortedArr,0, sortedArr.length-1, 40));
         System.out.println(binarySearch(sortedArr,0, sortedArr.length-1, 50));
         System.out.println(binarySearch(sortedArr,0, sortedArr.length-1, 60));
     }

Original file line number	Diff line number	Diff line change
`@@ -19,6 +19,9 @@ public class BinarySearch {`
`19`	`19`	`public static void main(String[] args) {`
`20`	`20`	`int[] sortedArr = {10, 20, 30, 40, 50};`
`21`	`21`
	`22`	`+ System.out.println(binarySearch(sortedArr,0, sortedArr.length-1, 10));`
	`23`	`+ System.out.println(binarySearch(sortedArr,0, sortedArr.length-1, 30));`
	`24`	`+ System.out.println(binarySearch(sortedArr,0, sortedArr.length-1, 40));`
`22`	`25`	`System.out.println(binarySearch(sortedArr,0, sortedArr.length-1, 50));`
`23`	`26`	`System.out.println(binarySearch(sortedArr,0, sortedArr.length-1, 60));`
`24`	`27`	`}`