diff --git a/divide and conquer.py b/divide and conquer.py
new file mode 100644
index 00000000..a54d2018
--- /dev/null
+++ b/divide and conquer.py	
@@ -0,0 +1,25 @@
+# divide and conquer algorithms with python
+list = [2, 7, 19, 34, 53, 72]
+
+
+def bsearch(list, val):
+    list_size = len(list) - 1
+
+    ldx0 = 0
+    ldxn = list_size
+
+    while ldx0 <= ldxn:
+        midval = (ldx0 + list_size) // 2
+
+        if list[midval] == val:
+            return midval
+        if val > list[midval]:
+            ldx0 = midval + 1
+        else:
+            ldxn = midval - 1
+    if ldx0 > ldxn:
+        return none
+
+
+print(bsearch(list, 19))
+print(bsearch(list, 11))