Lesson 2 fixing typo on class name

Author: cutajarj

src/main/java/com/packt/datastructuresandalg/lesson2/sorting/BinarySearchRecursive.java

@@ -10,7 +10,8 @@ public boolean binarySearch(int x, int[] sortedNumbers, int start, int end) {
         if (start <= end) {
             int mid = (end - start) / 2 + start;
             if (sortedNumbers[mid] == x) return true;
-            if (sortedNumbers[mid] > x) return binarySearch(x, sortedNumbers, start, mid - 1);
+            if (sortedNumbers[mid] > x)
+                return binarySearch(x, sortedNumbers, start, mid - 1);
             return binarySearch(x, sortedNumbers, mid + 1, end);
         }
         return false;