Update README.md

Author: dhrjklt

Search/BinarySearch/README.md

@@ -1,4 +1,4 @@
- Binary Search
+## Binary Search
 
 Given a sorted array arr[] of n elements, write a function to search a given element x in arr[].
 A simple approach is to do linear search.The time complexity of above algorithm is O(n). Another approach to perform the same task is using Binary Search.
@@ -10,6 +10,9 @@ The idea of binary search is to use the information that the array is sorted and
 We basically ignore half of the elements just after one comparison.
 
    1.Compare x with the middle element.
+   
    2.If x matches with middle element, we return the mid index.
-   3.Else If x is greater than the mid element, then x can only lie in right half subarray after the mid element. So we recur for right half.
+   
+   3.Else If x is greater than the mid element, then x can only lie in right half subarray after the mid element. So we recur      for right half.
+   
    4.Else (x is smaller) recur for the left half.