Update README.md

README.md

@@ -1,6 +1,9 @@
 # Binary-Search-1
 
-## Problem1 Search in a Rotated Sorted Array (https://leetcode.com/problems/search-in-rotated-sorted-array/)
+## Problem1 
+Search in a Rotated Sorted Array (https://leetcode.com/problems/search-in-rotated-sorted-array/)
+
+
 Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.
 
 (i.e., [0,1,2,4,5,6,7] might become [4,5,6,7,0,1,2]).
@@ -21,6 +24,7 @@ Input: nums = [4,5,6,7,0,1,2], target = 3
 Output: -1
 
 ## Problem2
-Search in Infinite sorted array 
+Search in Infinite sorted array: 
+
 Given a sorted array of unknown length and a number to search for, return the index of the number in the array. Accessing an element out of bounds throws exception. If the number occurs multiple times, return the index of any occurrence. If it isn’t present, return -1.