package main
import (
"fmt"
"math"
)
// Function to find the position of the first set bit
func findFirstSetBitPosition(num int) int {
// Edge case: If the number is 0, there are no set bits
if num == 0 {
return 0 // Return 0 to indicate no set bit
}
/*
num & -num isolates the lowest set bit.
math.Log2(...) gives the zero-based index of that bit.
*/
return int(math.Log2(float64(num & -num)))
}
func main() {
num := 4224 // Binary: 0001 0000 1000 0000
// Find and display the position of the first set bit
position := findFirstSetBitPosition(num)
if position == 0 {
fmt.Println("The number has no set bits (it's 0).")
} else {
fmt.Printf("The position of the first set bit is: %d\n", position)
}
}
/*
run:
The position of the first set bit is: 7
*/
