Closed HeuristicLab-Trac-Bot closed 8 years ago
- In place implementation that alters the array: see §8.5 select(), "Numerical Recipes in C"
- Non-destructive selection (is 10x slower than select()): see §8.5 selip(), "Numerical Recipes in C"
- For k << N (e.g. the 10 smallest or largest value in an array of 1000 elements): Use Heapsort "make a single pass through an array of length N while saving the m largest elements." "Only log m, rather than m, comparisons are required every time a new element is added to the candidate list."
- implemented O(n) algorithm for median (and general quantiles) determination.
- Comparing output of new implementation with naive implementation (as well as performance) in the unit test
- let's see if all samples still produce the same results...
merge this after #2488
Issue migrated from trac ticket # 2418
milestone: HeuristicLab 3.3.13 | component: Common | priority: medium | resolution: done
2015-07-07 12:34:35: @gkronber created the issue