SergeyButylkov
SergeyButylkov
/ gist:4256158
Created
December 11, 2012 05:41
— forked from andlima/gist:1774060
Median of medians selection algorithm
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| int find_kth(int *v, int n, int k) { | |
| if (n == 1 && k == 0) return v[0]; | |
| int m = (n + 4)/5; | |
| int *medians = new int[m]; | |
| for (int i=0; i<m; i++) { | |
| if (5*i + 4 < n) { | |
| int *w = v + 5*i; | |
| for (int j0=0; j0<3; j0++) { | |
| int jmin = j0; |