Breaking News: Grepper is joining You.com. Read the official announcement!

Pseudo Code for siftUp()

Poised Puma answered on May 4, 2022 Popularity 1/10 Helpfulness 1/10

answer Pseudo Code for siftUp()

Pseudo Code for siftUp()

Comment

siftUp(hPos, n, i)
    // Find parent
    parent = (i - 1) / 2;
    if (hPos[parent] > 0) 
        // For Max-Heap
        // If current node is greater than its parent
        // Swap both of them and call siftUp again
        // for the parent
        if (hPos[i] > hPos[parent]) 
            swap(hPos[i], hPos[parent]);
 
            // Recursively siftUp the parent node
            siftUp(hPos, n, parent);
        
    
// Function to insert a new node to the Heap
insertNode(hPos, n, Key)
    // Increase the size of Heap by 1
    n = n + 1;
    // Insert the element at end of Heap
    hPos[n - 1] = Key;
    // siftUp the new node following a
    // Bottom-up approach
    siftUp(hPos, n, n - 1);

Popularity 1/10 Helpfulness 1/10 Language whatever

Source: www.chegg.com

Tags: whatever

Link to this answer
Share Copy Link

Contributed on May 04 2022

Poised Puma

0 Answers Avg Quality 2/10

Continue with Google

By continuing, I agree that I have read and agree to Greppers's Terms of Service and Privacy Policy.

Pseudo Code for siftUp()

Contents

More Related Answers

Pseudo Code for siftUp()

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.