2 ms·

Then you don't get a guaranteed O(n) complexity if the approximated algorithm happen to make bad choices