From bbd272ff2a8001b0c662f28e82e917764b608bc1 Mon Sep 17 00:00:00 2001
From: Nishant Agrawal <41500636+nishantagrawal01@users.noreply.github.com>
Date: Sat, 30 Oct 2021 21:56:15 +0530
Subject: [PATCH] Create Find-Majority-Element(Moore's-Voting-Algorithm)

---
 ...Majority-Element(Moore's-Voting-Algorithm) | 40 +++++++++++++++++++
 1 file changed, 40 insertions(+)
 create mode 100644 OtherAlgorithms/Find-Majority-Element(Moore's-Voting-Algorithm)

diff --git a/OtherAlgorithms/Find-Majority-Element(Moore's-Voting-Algorithm) b/OtherAlgorithms/Find-Majority-Element(Moore's-Voting-Algorithm)
new file mode 100644
index 0000000..9188b4c
--- /dev/null
+++ b/OtherAlgorithms/Find-Majority-Element(Moore's-Voting-Algorithm)
@@ -0,0 +1,40 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+int majority_element(int arr[], int n)
+{
+    int cnt = 1, index = 0;
+    for(int i=1;i<n;i++) {
+        if(arr[i] == arr[index]) {
+            cnt++;
+        }
+        else {
+            cnt--;
+        }
+        if(cnt == 0) {
+            index = i;
+            cnt = 1;
+        }
+    }
+    return arr[index];
+}
+
+
+int main()
+{
+    int arr[] = {1,3,3,1,2};
+    int n = sizeof(arr)/sizeof(arr[0]);
+    int candid = majority_element(arr,n);
+    int cnt = 0;
+    for(int i=0;i<n;i++) {
+        if(arr[i] == arr[candid]) {
+            cnt++;
+        }
+    }
+    if(cnt > n/2) {
+        cout<<"Majority Element is "<<arr[candid];
+    }
+    else {
+        cout<<"No majority element found";
+    }
+}