Breaking News: Grepper is joining You.com. Read the official announcement!

13. Find The first set bit of the given number from left

aryan agarwal answered on August 26, 2023 Popularity 1/10 Helpfulness 1/10

answer 13. Find The first set bit of the given number from left

13. Find The first set bit of the given number from left

Comment

public class FirstSetBitPosition {
    public static void main(String[] args) {
        int num = 80; // Example number: 80

        int position = findFirstSetBitPosition(num);

        if (position != -1) {
            System.out.println("The first set bit position is: " + position);
        } else {
            System.out.println("No set bits found in the number.");
        }
    }

    // Function to find the position of the first set bit (1)
    public static int findFirstSetBitPosition(int num) {
        int position = 0;

        while (num > 0) {
            if ((num & 1) == 1) {
                return position + 1; // Adding 1 because positions are usually 1-indexed
            }
            num >>= 1; // Right shift by 1 to check the next bit
            position++;
        }

        return -1; // Return -1 if no set bits are found
    }
}

Popularity 1/10 Helpfulness 1/10 Language whatever

Source: chat.openai.com

Tags: bit find set whatever

Link to this answer
Share Copy Link

Contributed on Aug 26 2023

aryan agarwal

0 Answers Avg Quality 2/10

Continue with Google

By continuing, I agree that I have read and agree to Greppers's Terms of Service and Privacy Policy.

13. Find The first set bit of the given number from left

Contents

More Related Answers

13. Find The first set bit of the given number from left

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.