Java Program to Find Majority Element in a Sorted Array

This is a Java Program to Find if a given Integer X appears more than N/2 times in a Sorted Array of N Integers.

Enter size of array and then enter all the elements of that array. Now enter the element you want to check. With the help of for loop now we check if it occurs mre than n/2 times or not.

Here is the source code of the Java Program to Find if a given Integer X appears more than N/2 times in a Sorted Array of N Integers. The Java program is successfully compiled and run on a Windows system. The program output is also shown below.

  1. import java.util.Scanner;
  2. public class Appear_Array
  3. {
  4.     public static void main(String[] args) 
  5.     {
  6.         int n, x, count = 0, i = 0, temp = 0;
  7.         Scanner s = new Scanner(System.in);
  8.         System.out.print("Enter no. of elements you want in array:");
  9.         n = s.nextInt();
  10.         int a[] = new int[n];
  11.         System.out.println("Enter all the elements:");
  12.         for(i = 0; i < n; i++)
  13.         {
  14.             a[i] = s.nextInt();
  15.         }
  16.         for(i = 0; i < n; i++)
  17.         {
  18.             for(int j = i + 1; j < n; j++)
  19.             {
  20.                 if(a[i] > a[j])
  21.                 {
  22.                     temp = a[i];
  23.                     a[i] = a[j];
  24.                     a[j] = temp;
  25.                 }
  26.             }
  27.         }
  28.         System.out.print("Enter the element which you want to check:");
  29.         x = s.nextInt();
  30.         for(i = 0; i < n; i++)
  31.         {
  32.             if(a[i] == x)
  33.             {
  34.                 count++;
  35.             }
  36.         }
  37.         if(count > (n / 2))
  38.         {
  39.             System.out.println("Given Integer appears more than N/2 times");
  40.         }
  41.         else
  42.         {
  43.             System.out.println("Given Integer does not appear more than N/2 times");
  44.         }    
  45.     }
  46. }

Output:

$ javac Appear_Array.java
$ java Appear_Array
 
Enter no. of elements you want in array:5
Enter all the elements:
2
4
1
3
2
Enter the element which you want to check:2
Given Integer does not appear more than N/2 times

Sanfoundry Global Education & Learning Series – 1000 Java Programs.

advertisement
advertisement

Here’s the list of Best Books in Java Programming, Data Structures and Algorithms.

If you find any mistake above, kindly email to [email protected]

advertisement
advertisement
Subscribe to our Newsletters (Subject-wise). Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social networks below and stay updated with latest contests, videos, internships and jobs!

Youtube | Telegram | LinkedIn | Instagram | Facebook | Twitter | Pinterest
Manish Bhojasia - Founder & CTO at Sanfoundry
Manish Bhojasia, a technology veteran with 20+ years @ Cisco & Wipro, is Founder and CTO at Sanfoundry. He lives in Bangalore, and focuses on development of Linux Kernel, SAN Technologies, Advanced C, Data Structures & Alogrithms. Stay connected with him at LinkedIn.

Subscribe to his free Masterclasses at Youtube & discussions at Telegram SanfoundryClasses.