Merge pull request #1918 from rayeenshoaib/patch-36

Binary Search ReadMe File

Author: shoaibrayeen

Divide and Conquer/Binary Search/readMe.md

@@ -0,0 +1,5 @@
+### Binary Search: Search a sorted array by repeatedly dividing the search interval in half. Begin with an interval covering the whole array. If the value of the search key is less than the item in the middle of the interval, narrow the interval to the lower half. Otherwise narrow it to the upper half. Repeatedly check until the value is found or the interval is empty.
+
+Input -> 
+Size, Array(Must be sorted) and Key
+- User can add a check if Array is sorted or not