Merge pull request nryoung#38 from ConanChou/master

nryoung · nryoung · commit 3a6a8b3c1cb4 · 2013-03-10T12:36:53.000-07:00
Fixed the binary tree left and right nodes calculation
diff --git a/algorithms/sorting/heap_sort.py b/algorithms/sorting/heap_sort.py
@@ -19,8 +19,8 @@
 
 
 def max_heapify(seq, i, n):
-    l = i + 1
-    r = i + 2
+    l = 2 * i + 1
+    r = 2 * i + 2
 
     if l <= n and seq[l] > seq[i]:
         largest = l
