We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 195f0f3 commit f39d0d1Copy full SHA for f39d0d1
Algorithms/Array/moore.cpp
@@ -0,0 +1,43 @@
1
+#include<iostream>
2
+#include<conio.h>
3
+#include<stdlib.h>
4
+#include<bits/stdc++.h>
5
+
6
+using namespace std;
7
8
9
10
+main()
11
+{
12
+ int n,i=0;
13
+ cin>>n;
14
+ int arr[100];
15
+ while(i<n)
16
+ {
17
+ cin>>arr[i];
18
+ i++;
19
+ }
20
+int ele=arr[0],count=0,flag=0;
21
+ for(i=0;i<n;i++)
22
23
+ if(ele!=arr[i])
24
+ count--;
25
+ if(ele==arr[i])
26
+ count++;
27
+ if(count==0)
28
29
+ ele=arr[i];
30
31
32
33
34
+ if(arr[i]==ele)flag++;
35
36
+ if(flag>n/2)cout<<"majority element is "<<ele;
37
+ else
38
+ cout<<"No majority element";
39
40
+return 0;
41
+}
42
43
0 commit comments