What is the Big O of bit count? I'm not sure how the method works, but I would assume it is done in O(logn).
Specifically with this code (where x = 4, y = 1):
return Integer.bitCount(x^y);
3 Answers
Any algorithm that work on input of limited size have complexity of O(1).
bitCount works with input of limited size.
Therefore bitCount have complexity of O(1).
Related