Update README.md

dhrjklt · web-flow · commit c0f6abd1c282 · 2018-10-19T10:52:39.000+05:30
diff --git a/Search/BinarySearch/README.md b/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.

Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-##Binary Search`
	`1`	`+ Binary Search`
`2`	`2`
`3`	`3`	`Given a sorted array arr[] of n elements, write a function to search a given element x in arr[].`
`4`	`4`	`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.`