"Technically the runtime is O(n^2), but in real-world conditions n will never be larger than 1e6, so the algorithm never requires more than 1e12 operations, making the runtime O(1)."
6:27 AM - 25 Sep 2019
0 replies
0 retweets
2 likes
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.