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 | 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 |
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 |
---|