Fixed index out of bound error in rotated binary search with duplicates

Deveshb15 · Deveshb15 · commit 17324b2995b1 · 2021-08-23T12:16:00.000+05:30
diff --git a/lectures/10-binary search/code/src/com/kunal/RBS.java b/lectures/10-binary search/code/src/com/kunal/RBS.java
@@ -85,13 +85,13 @@ static int findPivotWithDuplicates(int[] arr) {
                 // skip the duplicates
                 // NOTE: what if these elements at start and end were the pivot??
                 // check if start is pivot
-                if (arr[start] > arr[start + 1]) {
+                if (start < end && arr[start] > arr[start + 1]) {
                     return start;
                 }
                 start++;
 
                 // check whether end is pivot
-                if (arr[end] < arr[end - 1]) {
+                if (end > start && arr[end] < arr[end - 1]) {
                     return end - 1;
                 }
                 end--;
