java中位数,中位数在Java中位数

I am trying to implement Median of Medians in Java for a method like this:

Select(Comparable[] list, int pos, int colSize, int colMed)

list is a list of values of which to find a specified position

pos is the specified position

colSize is the size of the columns that I create in the first stage

colMed is the position in those columns that I use as the medX

I am not sure which sorting algorithm would be the best to use or how to implement this exactly..

解决方案

I don't know if you still need this problem solved, but http://www.ics.uci.edu/~eppstein/161/960130.html has an algorithm:

select(L,k)

{

if (L has 10 or fewer elements)

{

sort L

return the element in the kth position

}

partition L into subsets S[i] of five elements each

(there will be n/5 subsets total).

for (i = 1 to n/5) do

x[i] = select(S[i],3)

M = select({x[i]}, n/10)

partition L into L1M

if (k <= length(L1))

return select(L1,k)

else if (k > length(L1)+length(L2))

return select(L3,k-length(L1)-length(L2))

else return M

}

Good luck!