Merge pull request #432 from a-ayush19/master

Most frequent element in an array

Contributors.html

@@ -573,6 +573,7 @@
       <a class="box-item" href="https://github.com/yamini236"><span>Yamini Bansal</span></a>
       <a class="box-item" href="https://github.com/whatiskeptiname"><span>Susan Ghimire</span></a>
 
+
       <a class="box-item" href="https://github.com/NitulKalita"><span>Nitul</span></a>
       <a class="box-item" href="https://github.com/jash-kothari"><span>Jash Kothari</span></a>
       <a class="box-item" href="https://github.com/SimonUR"><span>Simon</span></a>
@@ -588,6 +589,7 @@
       <a class="box-item" href="https://github.com/MFR414/"><span>M Firmansyah Rifai</span></a>
     <a class="box-item" href="https://github.com/AdityaSawant21"><spann>Aditya Sawant</span></a>
     <a class="box-item" href="https://github.com/kevadamar"><spann>Keva Damar Galih</span></a>
+     <a class="box-item" href="https://github.com/a-ayush19"><span>Ayush Awasthi</span></a>
 
 
       <!-- Please maintain the alignment... -->

Program's_Contributed_By_Contributors/C++_Programs/MostFreqElementInArray.cpp

@@ -0,0 +1,41 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+int mostFreq(int arr[], int n)
+{
+    // Sorting
+    sort(arr, arr + n);
+
+    // using linear traversal
+    int max_count = 1, res = arr[0], curr_count = 1;
+    for (int i = 1; i < n; i++) {
+        if (arr[i] == arr[i - 1])
+            curr_count++;
+        else {
+            if (curr_count > max_count) {
+                max_count = curr_count;
+                res = arr[i - 1];
+            }
+            curr_count = 1;
+        }
+    }
+
+    // if most freq = last element
+    if (curr_count > max_count)
+    {
+        max_count = curr_count;
+        res = arr[n - 1];
+    }
+
+    return res;
+}
+
+// driver program
+int main()
+{
+	//array
+	int arr[] = { 1, 7, 2, 3, 3, 2, 3 };
+    int n = sizeof(arr) / sizeof(arr[0]);
+    cout << mostFreq(arr, n);
+    return 0;
+}