3 ms·
If the data is small enough (up to about n=100 magnitude), linear scan O(n) often beats asymptotically faster algorithms.
by vardump 7y ago
If the data is small enough (up to about n=100 magnitude), linear scan O(n) often beats asymptotically faster algorithms.