solves binary search

Author: anishLearnsToCode

README.md

@@ -1,8 +1,8 @@
 # LeetCode Algorithms
 
-![problems-solved](https://img.shields.io/badge/Problems%20Solved-171/2081-1f425f.svg)
-![problems-solved-java](https://img.shields.io/badge/Java-171/2081-1abc9c.svg)
-![problems-solved-python](https://img.shields.io/badge/Python-171/2081-1abc9c.svg)
+![problems-solved](https://img.shields.io/badge/Problems%20Solved-172/2081-1f425f.svg)
+![problems-solved-java](https://img.shields.io/badge/Java-172/2081-1abc9c.svg)
+![problems-solved-python](https://img.shields.io/badge/Python-172/2081-1abc9c.svg)
 [![PRs Welcome](https://img.shields.io/badge/PRs-welcome-brightgreen.svg)](CONTRIBUTING.md)
 [![cp](https://img.shields.io/badge/also%20see-Competitve%20Programming-1f72ff.svg)](https://github.com/anishLearnsToCode/competitive-programming)
 
@@ -192,7 +192,7 @@
 | 697 | [Degree of an Array](https://leetcode.com/problems/degree-of-an-array) | [![Java](assets/java.png)](src/DegreeOfAnArray.java) [![Python](assets/python.png)](python/degree_of_an_array.py) |
 | 700 | [Search in a Binary Search Tree](https://leetcode.com/problems/search-in-a-binary-search-tree) | [![Java](assets/java.png)](src/SearchInBinarySearchTree.java) [![Python](assets/python.png)](python/search_in_binary_search_tree.py) |
 | 703 | [Kth Largest Element in a Stream](https://leetcode.com/problems/kth-largest-element-in-a-stream) | [![Java](assets/java.png)](src/KthLargestElementInAStream.java) [![Python](assets/python.png)](python/k_th_largest_element_in_a_stream.py) |
-| 704 | [Binary Search](https://leetcode.com/problems/binary-search) | |
+| 704 | [Binary Search](https://leetcode.com/problems/binary-search) | [![Java](assets/java.png)](src/BinarySearch.java) [![Python](assets/python.png)](python/binary_search.py) |
 | 705 | [Design HashSet](https://leetcode.com/problems/design-hashset) | |
 | 706 | [Design HashMap](https://leetcode.com/problems/design-hashmap) | |
 | 709 | [To Lower Case](https://leetcode.com/problems/to-lower-case) | |

python/binary_search.py

@@ -0,0 +1,12 @@
+from typing import List
+
+
+class Solution:
+    def search(self, array: List[int], target: int) -> int:
+        left, right = 0, len(array) - 1
+        while left <= right:
+            middle = left + (right - left) // 2
+            if array[middle] == target: return middle
+            elif array[middle] > target: right = middle - 1
+            else: left = middle + 1
+        return -1

src/BinarySearch.java

@@ -0,0 +1,13 @@
+public class BinarySearch {
+    public int search(int[] array, int val) {
+        int left = 0, right = array.length - 1, middle;
+        while (left <= right) {
+            middle = left + (right - left) / 2;
+            if (array[middle] == val) return middle;
+            else if (array[middle] > val) right = middle - 1;
+            else left = middle + 1;
+        }
+
+        return -1;
+    }
+}