You're given an array A[1..7] Heap-Insert(A, 8), what is the resulting A? = (9,7,6, 4, 1, 5, 3). If you execute Max-

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question
You're given an array A[1...7]
Heap-Insert(A, 8), what is the resulting A?
(9, 7, 6, 4, 1, 5, 3). If you execute Max-
Transcribed Image Text:You're given an array A[1...7] Heap-Insert(A, 8), what is the resulting A? (9, 7, 6, 4, 1, 5, 3). If you execute Max-
Expert Solution
Step 1

Code for your question: what will happened if execute max heap insertion



#include <iostream>
using namespace std;

#define MAX 1000

void heapify(int arr[], int n, int i)
{

    int parent = (i - 1) / 2;

    if (arr[parent] > 0)
    {

        if (arr[i] > arr[parent])
        {
            swap(arr[i], arr[parent]);

            heapify(arr, n, parent);
        }
    }
}

void insertNode(int arr[], int &n, int Key)
{

    n = n + 1;

    arr[n - 1] = Key;

    heapify(arr, n, n - 1);
}

void printArray(int arr[], int n)
{
    for (int i = 0; i < n; ++i)
        cout << arr[i] << " ";

    cout << "\n";
}

int main()
{

    int arr[MAX] = {9,7,6,4,1,5,3};

    int n = 7;

    int key = 8;

    insertNode(arr, n, key);

    printArray(arr, n);

    return 0;
}
steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Knowledge Booster
Heapsort
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education