We have an N*N matrix, can we achieve better than transposing the matrix into an array, and then sorting it?
I did some online searching and found that quickselect eliminates the log factor, how can we extend quickselect to 2 dimensions?
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3993 |
2 | jiangly | 3743 |
3 | orzdevinwang | 3707 |
4 | Radewoosh | 3627 |
5 | jqdai0815 | 3620 |
6 | Benq | 3564 |
7 | Kevin114514 | 3443 |
8 | ksun48 | 3434 |
9 | Rewinding | 3397 |
10 | Um_nik | 3396 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 155 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
10 | djm03178 | 152 |
We have an N*N matrix, can we achieve better than transposing the matrix into an array, and then sorting it?
I did some online searching and found that quickselect eliminates the log factor, how can we extend quickselect to 2 dimensions?
Название |
---|
Convert the matrix to an array first, then use
nth_element(x,x+n/2,x+n)
. The overall complexity is the same as the input complexity, which has reached the lower bound.nth_element is $$$\Theta(n)$$$.
nth_element is $$$O(n) $$$, not $$$\Theta(n)$$$
You're wrong, it's $$$\Theta(n)$$$, because it takes at least a linear perusal of all the elements to determine the value of the nth.
Just use the Thanos algorithm: among $$$n^2$$$ elements of the matrix, select random $$$n$$$ and find their median with
nth_element
;-)How can we efficiently select n random elements from the matrix without iterating over the full matrix?
And let's we want to extend the program, and find the smallest median among every submatrix of size K*K, how can we solve this?
binary search
With binary search wouldnt it be N^2*K*logK, but can we achieve N^2*K or better?
Auto comment: topic has been updated by MODDI (previous revision, new revision, compare).