Add comments

harishvc · Apr 27, 2016 · 5e13723 · 5e13723
1 parent 8ab3c32
commit 5e13723
Showing 1 changed file with 5 additions and 3 deletions.
diff --git a/binary-search-tree-search-sorted-rotated-list.py b/binary-search-tree-search-sorted-rotated-list.py
@@ -21,15 +21,16 @@ def BST(t2,target,start,end):
         return False
     elif (t2[mid] == target):
         return True
-    #sorted
+    #check if sorted: value at start < value at middle
     elif( t2[start] <= t2[mid]):
         if (target >= t2[start] and target <= t2[mid]):
             return BST(t2,target,start,mid-1)
         else:
             return BST(t2,target,mid+1,end)
-    #unsorted
+    #unsorted: target on the right
     elif (target >= target[mid] and target <= target[end]):
         return BST(t2,target,mid+1,end)
+    #unsorted: target on the left, target > start and target > middle
     else:
         return BST(t2,target,start,mid-1)
 
@@ -39,4 +40,5 @@ def BST(t2,target,start,end):
 target = [4,50]
 for x in target:
     result = BST(t2,x,0,len(t2)-1)    
-    print("target=",x, " Found=", result)    
+    print("target=",x, " Found=", result)    
+