2 ms·
If for all realistically possible n your O(log n) function is faster than O(1) function, then calling your function K times will still be faster than calling th
by ajuc 12y ago
If for all realistically possible n your O(log n) function is faster than O(1) function, then calling your function K times will still be faster than calling that O(1) function K times.