Home » Java Programs » Java Basic Programs

Java program to find the highest bit set for a given integer number

Given an integer number, we have to find the highest bit set for a given integer number.
Submitted by Nidhi, on March 09, 2022

Problem Solution:

In this program, we will read an integer number from the user. Then we will find the high bit set for the given number.

Program/Source Code:

The source code to find the highest bit set for a given integer number is given below. The given program is compiled and executed successfully.

// Java program to find the highest bit set 
// for any given integer number

import java.util.Scanner;

public class Main {
  public static void main(String[] args) {
    Scanner SC = new Scanner(System.in);

    int num = 0;
    int count = 0;
    int highBit = -1;

    System.out.printf("Enter Number: ");
    num = SC.nextInt();

    while (num != 0) {
      if ((num & 1) == 1)
        highBit = count;
      num = num >> 1;
      count++;
    }

    if (highBit == -1) {
      System.out.printf("No bit is set\n");
    } else {
      System.out.printf("Highest bit set : %d \n", highBit);
    }
  }
}

Output:

Enter Number: 25
Highest bit set : 4

Explanation:

In the above program, we imported the java.util.Scanner package to read the variable's value from the user. And, created a public class Main. It contains a static method main().

The main() method is an entry point for the program. Here, we read an integer number from the user using the Scanner class and find the highest set bit of the given number and printed the result.

Java Basic Programs »

---