mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-11-24 13:31:07 +00:00
35 lines
850 B
Python
35 lines
850 B
Python
def get_highest_set_bit_position(number: int) -> int:
|
|
"""
|
|
Returns position of the highest set bit of a number.
|
|
Ref - https://graphics.stanford.edu/~seander/bithacks.html#IntegerLogObvious
|
|
>>> get_highest_set_bit_position(25)
|
|
5
|
|
>>> get_highest_set_bit_position(37)
|
|
6
|
|
>>> get_highest_set_bit_position(1)
|
|
1
|
|
>>> get_highest_set_bit_position(4)
|
|
3
|
|
>>> get_highest_set_bit_position(0)
|
|
0
|
|
>>> get_highest_set_bit_position(0.8)
|
|
Traceback (most recent call last):
|
|
...
|
|
TypeError: Input value must be an 'int' type
|
|
"""
|
|
if not isinstance(number, int):
|
|
raise TypeError("Input value must be an 'int' type")
|
|
|
|
position = 0
|
|
while number:
|
|
position += 1
|
|
number >>= 1
|
|
|
|
return position
|
|
|
|
|
|
if __name__ == "__main__":
|
|
import doctest
|
|
|
|
doctest.testmod()
|