HackerTrans
トップ新着トレンドコメント過去質問紹介求人

danlark

no profile record

投稿

Miniselect: Practical Linear Time Median Algorithms

danlark.org
2 ポイント·投稿者 danlark·2 年前·0 コメント

RE2 maintainer Paul Wankadia died

github.com
70 ポイント·投稿者 danlark·2 年前·11 コメント

コメント

danlark
·2 年前·議論
3 and 4 elements will fail to prove the complexity is linear

You still can do 3 or 4 but with slight modifications

https://arxiv.org/abs/1409.3600

For example, for 4 elements, it's advised to take lower median for the first half and upper median for the second half. Then the complexity will be linear
danlark
·2 年前·議論
Around 4 years ago I compared lots of different median algorithms and the article turned out to be much longer than I anticipated :)

https://danlark.org/2020/11/11/miniselect-practical-and-gene...
danlark
·3 年前·議論
Disclaimer: the author of the comment is the CEO of ClickHouse