-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmedianFromDataStream.cpp
61 lines (56 loc) · 1.29 KB
/
medianFromDataStream.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
#include <iostream>
#include <queue>
#include <vector>
#include <functional>
using std::vector;
using std::priority_queue;
using std::greater;
double medianFromData(priority_queue<double>& maxQ,
priority_queue<double, vector<double>, greater<double> >& minQ,
double median, int input){
if (maxQ.size() > minQ.size()){
if( input < median){
minQ.push(maxQ.top());
maxQ.pop();
maxQ.push(input);
}
else{
minQ.push(input);
}
median = (maxQ.top() + minQ.top()) / 2.0;
}
else if (maxQ.size() < minQ.size()){
if (input > median){
maxQ.push(minQ.top());
minQ.pop();
minQ.push(input);
}
else{
maxQ.push(input);
}
median = (maxQ.top() + minQ.top()) / 2.0;
}
else{
if (input < median){
maxQ.push(input);
median = maxQ.top();
}
else{
minQ.push(input);
median = minQ.top();
}
}
return median;
}
int main(){
priority_queue<double> maxQ{};
priority_queue<double, vector<double>, greater<double> > minQ{};
vector<int> input{1,2,3,4,5,6,7};
double median = input[0];
maxQ.push(input[0]);
for (int i=1; i < input.size(); ++i){
median = medianFromData(maxQ,minQ, median, input[i]);
std::cout << "Current median: " << median << std::endl;
}
return 0;
}