3 ms·
Here's how you can do a 'branchless' one, using Python syntax: f = lambda n: (n & 1) * n + ((n + 1) >> 1) No need to count any trailing zeros. Of course,
by eru 4y ago
Here's how you can do a 'branchless' one, using Python syntax:
f = lambda n: (n & 1) * n + ((n + 1) >> 1)
No need to count any trailing zeros.
Of course, the multiplication sort-of acts as a branch.