#increase the key in heap
heap_a = [18, 14, 4, 7, 10, 3]
print(heap_a)
def increase_key(a,i,key):
#check whether new value is greater then node
if key < a[0]:
print('select large value greater than {}'.format(a[0]))
#assign the key to respective index
a[i] = key
while i-1//2 > 0 and a[(i-1//2)] < a[i]:
#swap if parent is smaller than current node
a[i], a[(i-1//2)] = a[(i-1//2)], a[i]
i = (i-1//2)
return a
increase_a = increase_key(heap_a,4,20)
print(increase_a)
与恶龙缠斗过久,自身亦成为恶龙;凝视深渊过久,深渊将回以凝视…