add pdb in code

Author: renwl

sorts/heap_sort.py

@@ -12,22 +12,25 @@
 
 from __future__ import print_function
 
-
+import pdb
 def heapify(unsorted, index, heap_size):
-    largest = index
-    left_index = 2 * index + 1
-    right_index = 2 * index + 2
-    if left_index < heap_size and unsorted[left_index] > unsorted[largest]:
-        largest = left_index
-
-    if right_index < heap_size and unsorted[right_index] > unsorted[largest]:
-        largest = right_index
-
-    if largest != index:
-        unsorted[largest], unsorted[index] = unsorted[index], unsorted[largest]
-        heapify(unsorted, largest, heap_size)
-
-
+		print("in heapify:	", "index=",index,"	list=",unsorted)
+		
+		largest = index
+		left_index = 2 * index + 1
+		right_index = 2 * index + 2
+		if left_index < heap_size and unsorted[left_index] > unsorted[largest]:
+		    largest = left_index
+		
+		if right_index < heap_size and unsorted[right_index] > unsorted[largest]:
+		    largest = right_index
+		
+		if largest != index:
+		    unsorted[largest], unsorted[index] = unsorted[index], unsorted[largest]
+		    #print("in heapify:	",unsorted)
+		    heapify(unsorted, largest, heap_size)
+		
+		
 def heap_sort(unsorted):
     '''
     Pure implementation of the heap sort algorithm in Python
@@ -45,11 +48,13 @@ def heap_sort(unsorted):
     >>> heap_sort([-2, -5, -45])
     [-45, -5, -2]
     '''
+    print("in heap_sort:	", "	list=",unsorted)
     n = len(unsorted)
     for i in range(n // 2 - 1, -1, -1):
         heapify(unsorted, i, n)
     for i in range(n - 1, 0, -1):
         unsorted[0], unsorted[i] = unsorted[i], unsorted[0]
+        #print("in heap_sort:	",unsorted)
         heapify(unsorted, 0, i)
     return unsorted
 
@@ -61,7 +66,8 @@ def heap_sort(unsorted):
 	else:
 	    input_function = input
 	tstart=time.clock()
-	unsorted=list(range(150000,1,-1))
+	pdb.set_trace()
+	unsorted=list(range(10,1,-1))
 	#print(sort(unsorted))
 	print(heap_sort(unsorted))
 	tend=time.clock()