3 ms·
> This algorithm is proven to be O(n log n) only for numbers with at least 2^4096... No worries, all the rest runs in O(1)..
by klyrs 8y ago
> This algorithm is proven to be O(n log n) only for numbers with at least 2^4096...
No worries, all the rest runs in O(1)..