According to wikipedia, Bitonic sort complexity is log^2n. Is it true ?
# | User | Rating |
---|---|---|
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 |
# | 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 |
Question on Bitonic Sort
According to wikipedia, Bitonic sort complexity is log^2n. Is it true ?
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en4 | 1.LaZyPersoN | 2023-10-12 17:25:52 | 12 | |||
en3 | 1.LaZyPersoN | 2023-10-12 17:24:52 | 0 | (published) | ||
en2 | 1.LaZyPersoN | 2023-10-12 17:24:26 | 45 | |||
en1 | 1.LaZyPersoN | 2023-10-12 17:22:20 | 50 | Initial revision (saved to drafts) |
Name |
---|