test: add unit test for handling middle element in right sorted half of rotated array

Author: GziXnine

src/test/java/com/thealgorithms/searches/RotatedBinarySearchTest.java

@@ -35,6 +35,13 @@ void shouldReturnMinusOneWhenNotFound() {
         assertEquals(-1, search.find(array, 3));
     }
 
+    @Test
+    void shouldHandleWhenMiddleIsGreaterThanKeyInRightSortedHalf() {
+        RotatedBinarySearch search = new RotatedBinarySearch();
+        Integer[] array = {6, 7, 0, 1, 2, 3, 4, 5};
+        assertEquals(2, search.find(array, 0));
+    }
+
     @Test
     void shouldHandleDuplicates() {
         RotatedBinarySearch search = new RotatedBinarySearch();