2 ms·
>Not faster for sufficiently large N (by definition). True, but supposedly researchers keep publishing algorithms with lower complexity that will be faster onl
by BeetleB 9y ago
>Not faster for sufficiently large N (by definition).
True, but supposedly researchers keep publishing algorithms with lower complexity that will be faster only if N is, like 10^30 or so.
Or so Sedgwick keeps telling us.