Quantum BogoSort is the fastest algorithm for sorting elements. That's all you need to know! I made a video for 3blue1brown summer of math exposition 2 on Quantum BogoSort, so I thought I should share it here.
# | User | Rating |
---|---|---|
1 | tourist | 3985 |
2 | jiangly | 3814 |
3 | jqdai0815 | 3682 |
4 | Benq | 3529 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3517 |
7 | Radewoosh | 3410 |
8 | hos.lyric | 3399 |
9 | ecnerwala | 3392 |
9 | Um_nik | 3392 |
# | User | Contrib. |
---|---|---|
1 | cry | 170 |
2 | maomao90 | 162 |
2 | Um_nik | 162 |
4 | atcoder_official | 160 |
5 | djm03178 | 158 |
6 | -is-this-fft- | 157 |
7 | adamant | 155 |
8 | Dominater069 | 154 |
9 | awoo | 153 |
10 | luogu_official | 150 |
Quantum BogoSort is the fastest algorithm for sorting elements. That's all you need to know! I made a video for 3blue1brown summer of math exposition 2 on Quantum BogoSort, so I thought I should share it here.
My day went really bad, so now I want you to feel bad about yourself.
A quote from ScarletS
I recently found about the asm
keyword in c++ that allows us to write inline assembly in c++. Is there any way to cheese solutions by it? I googled but they say "constants don't matter, focus on complexity.." I KNOW, THANK YOU. I want to know will it make my n^3 pass in n<=1000
asm reference
Name |
---|