Number of steps for a binary search
Japt, 13 12 bytes
Oh my gosh I was beating both Jelly and Pyth for a time :D
¢a1 ªJ +1+¢l

Test it online!
Here's the strategy I use: let x be the input integer, and let b be x's binary representation. The correct output is 1 + the length of b + the last index of a 1 in b, minus 1 if this index is 0.