Sep 25, 2019 · I am working with the median-median algorithm or BFPRT algorithm and I seek to understand why would the partition of the array by $7$ blocks would work but with the $3$ fail? If we …

Jun 12, 2020 · I know that Median of medians itself is $O (n)$. With a good pivot, QuickSelect is $O (n)$, too -- but with a bad one, it's $O (n^2)$. But if I now were to use the ...

@SzymonStankiewicz, I've made a Greedy algorithm that will simply create partitions not exceeding a target which is set to the average partition weight, and whatever is left is assigned to the last …