3 ms·
That's well above the "O(log n)" level from the rest of the list. After all, "algorithms O(log n)" is not "you are Knuth".
by JoachimSchipper 16y ago
That's well above the "O(log n)" level from the rest of the list. After all, "algorithms O(log n)" is not "you are Knuth".