Answered: Rearrange to the code to insert each…

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

See similar textbooks

Related questions

Question

Rearrange to the code to insert each element into 'left' if it is smaller than the largest element of left.
You can find the median element of a sequence by using two priority queues, left and right, where right is a min-heap. Insert each element into left if it is smaller than the largest element of left, or into right otherwise. Then rebalance the priority queues so that their sizes differ by at most 1.

Rearrange the following lines of code to implement this algorithm. Instead of a min-heap, use a priority_queue<int> that holds negated values. **Only add lines provided from "Unused" not all lines will be used**

Unused
}
if (left.size() < right.size ())
{
if (a[i] <= left.top())
{
right .push(-a[i]);
else if (left.size() > right.size() + 1)
{
}
left.push(a[0]);
for (int i 1; i<n; i++)
{
left.push(a[i]);
else
{
right.push(-left.top()); left.pop();
}
}
return median;
left .push(-right.top()); right.pop();
int median = left. top();
}

main.cpp
#include <iostream>
#include <vector>
#include <queue>
#include <bits/stdc++.h>
using namespace std;
int get median (vector<int> a, int n)
{
priority_queue<int> left;
priority_queue<int> right;
}
int main()
{
}
vector<int> a;
int i;
cin >> i;
while (i)
{
a.push_back(i);
cin >> i;
}
int median = get_median (a, a.size());
sort(a. begin (), a.end());
cout << "Sorted: (";
for (int x = 0; x < a.size(); x++)
{
}
cout << a[x];
if (x != a.size() - 1) cout <<
Load default template...
return 0;
3
cout<<")" << endl;
cout << "Median: << median << endl;

Expert Solution

Step by step

Solved in 3 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

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

Computer Science

ISBN:

9780078022159

Author:

Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:

McGraw-Hill Education