44 lines
1.2 KiB
C
44 lines
1.2 KiB
C
|
// Copyright (c) 2012-2015, The CryptoNote developers, The Bytecoin developers
|
||
|
//
|
||
|
// This file is part of Bytecoin.
|
||
|
//
|
||
|
// Bytecoin is free software: you can redistribute it and/or modify
|
||
|
// it under the terms of the GNU Lesser General Public License as published by
|
||
|
// the Free Software Foundation, either version 3 of the License, or
|
||
|
// (at your option) any later version.
|
||
|
//
|
||
|
// Bytecoin is distributed in the hope that it will be useful,
|
||
|
// but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||
|
// GNU Lesser General Public License for more details.
|
||
|
//
|
||
|
// You should have received a copy of the GNU Lesser General Public License
|
||
|
// along with Bytecoin. If not, see <http://www.gnu.org/licenses/>.
|
||
|
|
||
|
#pragma once
|
||
|
|
||
|
#include <algorithm>
|
||
|
#include <vector>
|
||
|
|
||
|
namespace Common {
|
||
|
|
||
|
template <class T>
|
||
|
T medianValue(std::vector<T> &v) {
|
||
|
if (v.empty())
|
||
|
return T();
|
||
|
|
||
|
if (v.size() == 1)
|
||
|
return v[0];
|
||
|
|
||
|
auto n = (v.size()) / 2;
|
||
|
std::sort(v.begin(), v.end());
|
||
|
//nth_element(v.begin(), v.begin()+n-1, v.end());
|
||
|
if (v.size() % 2) { //1, 3, 5...
|
||
|
return v[n];
|
||
|
} else { //2, 4, 6...
|
||
|
return (v[n - 1] + v[n]) / 2;
|
||
|
}
|
||
|
}
|
||
|
|
||
|
}
|