binary_search_algorith

avinashn · avinashn · commit b377a990006a · 2018-01-09T22:33:17.000+05:30
diff --git a/Algorithms/Search Algorithms/binary_search.py b/Algorithms/Search Algorithms/binary_search.py
@@ -0,0 +1,33 @@
+__author__ = 'Avinash'
+
+
+def binary_sort(sorted_list, length, key):
+    start = 0
+    end = length-1
+    while start <= end:
+        mid = int((start + end)/2)
+        if key == sorted_list[mid]:
+            print("\nEntered number %d is present "
+                  "at position: %d" % (key, mid))
+            return -1
+        elif key < sorted_list[mid]:
+            end = mid - 1
+        elif key > sorted_list[mid]:
+            start = mid + 1
+    print("\nElement not found!")
+    return -1
+
+lst = []
+
+size = int(input("Enter size of list: \t"))
+
+for n in range(size):
+    numbers = int(input("Enter any number: \t"))
+    lst.append(numbers)
+
+lst.sort()
+print('\n\nThe list will be sorted, the sorted list is:', lst)
+
+x = int(input("\nEnter the number to search: "))
+
+binary_sort(lst, size, x)
