We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
I'm late, but if we assume multiplication and addition to be O(1), the logarithm function is still O(log n). Since we have hardware acceleration for the logarithm, it's still faster than the iterative solution, but only by a constant factor
Strange Counter
You are viewing a single comment's thread. Return to all comments →
I'm late, but if we assume multiplication and addition to be O(1), the logarithm function is still O(log n). Since we have hardware acceleration for the logarithm, it's still faster than the iterative solution, but only by a constant factor