-
Notifications
You must be signed in to change notification settings - Fork 0
/
MajorityElementSort.java
46 lines (37 loc) · 1.01 KB
/
MajorityElementSort.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
import java.util.Scanner;
public class MajorityElementSort
{
public static void main(String arg[])
{
Scanner sc = new Scanner(System.in);
System.out.print("Enter the number of elements: ");
int n = sc.nextInt();
int arr[] = new int[n];
for(int i = 0; i < n; i++)
{
System.out.print("Enter element: ");
arr[i] = sc.nextInt();
}
System.out.println();
MajorityElementSort sort = new MajorityElementSort();
sort.majority(arr);
sc.close();
}
public void majority(int arr[])
{
int temp;
for(int i = 0;i<arr.length-1;i++)
{
for(int j = 0;j<arr.length-1-i;j++)
{
if(arr[j]>arr[j+1])
{
temp = arr[j+1];
arr[j+1] = arr[j];
arr[j] = temp;
}
}
}
System.out.println("The Majority Element: " + arr[arr.length/2]);
}
}