mgs/median-comparison
2
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

removed some comments and newlines

Browse Source
This commit is contained in:
incredibleLeitman 2020-10-18 12:28:33 +02:00
parent 74d6fabf68
commit 6357dd605b
2 changed files with 2 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
MedianOfMedians.h
View File

@ -7,6 +7,7 @@ uint32_t partition(std::vector<uint32_t> &v, uint32_t left, uint32_t right, uint
// Return the index of an element which is close to (but likely not exactly) the median. // Return the index of an element which is close to (but likely not exactly) the median.
uint32_t findMedianOfMedians(std::vector<uint32_t> &v, uint32_t left, uint32_t right, uint32_t n) { uint32_t findMedianOfMedians(std::vector<uint32_t> &v, uint32_t left, uint32_t right, uint32_t n) {
while (true) { while (true) {
if (left == right) { if (left == right) {
return left; return left;
@ -26,8 +27,8 @@ uint32_t findMedianOfMedians(std::vector<uint32_t> &v, uint32_t left, uint32_t r
} }
uint32_t partition(std::vector<uint32_t> &v, uint32_t left, uint32_t right, uint32_t pivotIndex, uint32_t n) { uint32_t partition(std::vector<uint32_t> &v, uint32_t left, uint32_t right, uint32_t pivotIndex, uint32_t n) {
uint32_t pivotValue = v[pivotIndex];
uint32_t pivotValue = v[pivotIndex];
swap(&v[pivotIndex], &v[right]); swap(&v[pivotIndex], &v[right]);
uint32_t storeIndex = left; uint32_t storeIndex = left;
@ -72,10 +73,8 @@ uint32_t partition5(std::vector<uint32_t> &v, uint32_t left, uint32_t right) {
swap(&v[j - 1], &v[j]); swap(&v[j - 1], &v[j]);
j = j - 1; j = j - 1;
} }
i = i + 1; i = i + 1;
} }
return (left + right) / 2; return (left + right) / 2;
} }

3
main.cpp
View File

@ -9,9 +9,6 @@
#include "RandomizedSelect.h" #include "RandomizedSelect.h"
#include "Wirth.h" #include "Wirth.h"
// TODO:
// - combine partition function
// - fix Median of Medians
int main(int argc, char** argv) int main(int argc, char** argv)
{ {