Help me in solving HEAP14 problem

help
,
1

My issue

function insert(val)
cur_index = size of arr - 1
parent_index = (cur_index-1)/2
if (arr[parent_index]>arr[cur_index])
cur_index = parent_index
while (cur_index not equals 0)
swap arr[parent_index] and arr[cur_index]
push val in arr

Learning course: Heaps
Problem Link: Rearrange insert pseudo-code Practice Problem in Heaps - CodeChef

2

@bittukumar9631
this will be the correct rearrangement

function insert(val)
    push val in arr
    cur_index = size of arr - 1
    while (cur_index not equals 0)
        parent_index = (cur_index-1)/2
        if (arr[parent_index]>arr[cur_index])
            swap arr[parent_index] and arr[cur_index]
        cur_index = parent_index