diff --git a/coding/python/binary_search.py b/coding/python/binary_search.py
index 2fd753c..cb4fefb 100644
--- a/coding/python/binary_search.py
+++ b/coding/python/binary_search.py
@@ -2,11 +2,10 @@
 
 import random
 
-rand_num_li = sorted([random.randint(1, 50) for _ in range(10)])
-target = random.randint(1, 50)
-
-
 def binary_search(arr, lb, ub, target):
+    """
+    A Binary Search Example which has O(log n) time complexity. 
+    """
     if lb <= ub:
         mid = ub + lb // 2
         if arr[mid] == target:
@@ -18,7 +17,9 @@ def binary_search(arr, lb, ub, target):
     else:
         return -1
 
-
-print("List: {}\nTarget: {}\nIndex: {}".format(
-    rand_num_li, target,
-    binary_search(rand_num_li, 0, len(rand_num_li) - 1, target)))
+if __name__ == '__main__':
+    rand_num_li = sorted([random.randint(1, 50) for _ in range(10)])
+    target = random.randint(1, 50)
+    print("List: {}\nTarget: {}\nIndex: {}".format(
+        rand_num_li, target,
+        binary_search(rand_num_li, 0, len(rand_num_li) - 1, target)))