Given 2 dimensional sorted array(Both row and column wise sorted) write a efficient algo to find median.
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
9 | nor | 153 |
Given 2 dimensional sorted array(Both row and column wise sorted) write a efficient algo to find median.
Name |
---|
Looks very similar to finding k-th element of two sorted arrays, which I've seen at TC forums.
Use binary search over the value of the median. Complexity would be O(Rlog(C) log(MaxVal)).
Guess it can be done in a better way since this way you wouldn't use the fact that the columns are sorted.
It seems there is an O(n) algorithm to this problem.