1 def PrintArrayTree(arr):
 2     frontRowSum=1 #Number of digits in front of n-1 rows
 3     row=1      #row n(start from 1)
 4     for i in range(0,len(arr)):
 5         if i==frontRowSum:
 6             frontRowSum=frontRowSum+2**row #Number of digits in front of n rows
 7             print("\n")#the next row
 8             row=row+1
 9         print (arr[i],end="  ") #print digits
10     print("Over")
11
12 arr=[10,9,8,7,6,5,4,3,2,1,234,562,452,23623,565,5,26]
13 PrintArrayTree(arr)

 1 def FindNode(arr,row,cloumn):
 2
 3     if row<1 or cloumn<1:
 4         print("the number of row and column must be greater than 1")
 5         return
 6     if cloumn>2**(row-1):
 7         print("this row just ",2**(row-1),"numbers")
 8         return
 9
10     frontRowSum=0
11     CurrentRowSum=0
12     for index in range(0,row-1):
13         CurrentRowSum=2**index  #the number of  digits in current row
14         frontRowSum=frontRowSum+CurrentRowSum #the number of  digits of all rows
15     NodeIndex=frontRowSum+cloumn-1   #find the location of the node in the array by row and cloumn
16
17     if NodeIndex>len(arr)-1:
18         print("out of this array")
19         return
20
21     currentNode=arr[NodeIndex]
22
23     childIndex=NodeIndex*2+1
24
25     print("Current Node:",currentNode)
26
27     if row==1:              #row 1 have no parent node
28         print("no parent node!")
29     else:                   #the parent node ofcurrent node
30         parentIndex=int((NodeIndex-1)/2)
31         parentNode=arr[parentIndex]
32         print("Parent Node:",parentNode)
33
34     if childIndex+1>len(arr):   #print leftChild node
35         print("no left child node!")
36     else:
37         leftChild=arr[childIndex]
38         print("Left Child Node:",leftChild)
39
40
41     if childIndex+1+1>len(arr):     #print rightChild node
42         print("no left right node!")
43     else:
44         rightChild=arr[childIndex+1]
45         print("Right Child Node:",rightChild)
46
47     print("\n")
48
49 arr=[10,9,8,7,6,5,4,3,2,1,234,562,452,23623,565,5,26]
50 FindNode(arr,1,1)
51 FindNode(arr,2,2)
52 FindNode(arr,4,1)

def MinSort(arr,row,cloumn):if row<1 or cloumn<1:print("the number of row and column must be greater than 1")returnif cloumn>2**(row-1):print("this row just ",2**(row-1),"numbers")returnfrontRowSum=0CurrentRowSum=0for index in range(0,row-1):   CurrentRowSum=2**index  #the number of  digits in current rowfrontRowSum=frontRowSum+CurrentRowSum  #the number of  digits of all rowsNodeIndex=frontRowSum+cloumn-1 #find the location of the node in the array by row and cloumnif NodeIndex>len(arr)-1:print("out of this array")returncurrentNode=arr[NodeIndex]childIndex=NodeIndex*2+1print("Current Node:",currentNode)if row==1:print("no parent node!")else:parentIndex=int((NodeIndex-1)/2)parentNode=arr[parentIndex]print("Parent Node:",parentNode)if childIndex+1>len(arr):print("no left child node!")else:leftChild=arr[childIndex]print("Left Child Node:",leftChild)if currentNode>leftChild:print("swap currentNode and leftChild")temp=currentNodecurrentNode=leftChildleftChild=temparr[childIndex]=leftChildif childIndex+1>=len(arr):print("no right child node!")else:rightChild=arr[childIndex+1]    print("Right Chile Node:",rightChild)if currentNode>rightChild:print("swap rightCild and leftChild")temp=rightChildrightChild=currentNodecurrentNode=temparr[childIndex+1]=rightChildarr[NodeIndex]=currentNode arr=[10,9,8,7,6,5,4,3,2,1,234,562,452,23623,565,5,26]
print("initial array:",arr)
MinSort(arr,1,1)
print("result array:",arr)

def MinHeap(arr):frontRowSum=1row=1for i in range(0,len(arr)):if i==frontRowSum:frontRowSum=frontRowSum+2**row #the number of  digits of all rowsprint("\n") # next rowrow=row+1print (arr[i],end="  ")print("row",row)rowIndex=row-1    #the last row have no child node print("rowIndex",rowIndex)column=2**(rowIndex-1)  #the number of digits of current rowprint("column",column)number=len(arr)while rowIndex>0:   #sort the nodes that have child nodes from the last number to the first numberif number<=2**(rowIndex-1):rowIndex=rowIndex-1column=2**(rowIndex-1)print("sort",rowIndex,column)MinSort(arr,rowIndex,column)number=number-1column=column-1arr=[10,9,8,7,6,5,4,3,2,1,234,562,452,23623,565,5,26]
print("initial array:",arr)PrintArrayTree(arr)
MinHeap(arr)
print("result array:",arr)PrintArrayTree(arr)

 1 def HeapSort(arr):
 2     arr2=[]
 3     for i in range(0,len(arr)):
 4         MinHeap(arr)
 5         arr2.append(arr[0])
 6         del arr[0]
 7     return arr2
 8
 9 arr=[10,9,8,7,6,5,4,3,2,1,234,562,452,23623,565,5,26]
10 print("initial array:",arr)
11 PrintArrayTree(arr)
12 resultArr=HeapSort(arr)
13 print("result array:",resultArr)
14 PrintArrayTree(resultArr)

 1 def MinSort(arr,start,end):
 2     import math
 3     arrHeight=0
 4     for index in range(0,end-start):
 5         if index==2**(arrHeight+1)-1:
 6             arrHeight=arrHeight+1
 7
 8     for NodeIndex in range(2**(arrHeight)-2,-1,-1):
 9         currentNode=arr[NodeIndex+start]
10         childIndex=NodeIndex*2+1+start
11
12         if childIndex+1>len(arr):
13             continue
14         else:
15             leftChild=arr[childIndex]
16
17             if currentNode>leftChild:
18                 temp=currentNode
19                 currentNode=leftChild
20                 leftChild=temp
21                 arr[childIndex]=leftChild
22                 arr[NodeIndex+start]=currentNode
23
24         if childIndex+1>=len(arr):
25             continue
26         else:
27             rightChild=arr[childIndex+1]
28             if currentNode>rightChild:
29
30                 temp=rightChild
31                 rightChild=currentNode
32                 currentNode=temp
33                 arr[childIndex+1]=rightChild
34                 arr[NodeIndex+start]=currentNode
35
36
37 def HeapSort(arr):
38     for i in range(0,len(arr)-1):
39         MinSort(arr,i,len(arr))
40
41
42 arr=[10,9,8,7,6,5,4,3,2,1,234,562,452,23623,565,5,26]
43
44 print("Initial array:\n",arr)
45 HeapSort(arr)
46 print("Result array:\n",arr)