most_occuring_ele.cpp

#include <iostream>
using namespace std;
 
int mostFrequent(int* arr, int n)
{
    
    int maxcount = 0;
    int element_having_max_occ;
    for (int i = 0; i < n; i++) {
        int count = 0;
        for (int j = 0; j < n; j++) {
            if (arr[i] == arr[j])
                count++;
        }
 
        if (count > maxcount) {
            maxcount = count;
            element_having_max_occ = arr[i];
        }
    }
 
    return element_having_max_occ;
}
 

int main()
{
    int arr[] = { 40, 10, 20, 40, 10, 20, 20 };
    int n = sizeof(arr) / sizeof(arr[0]);
    cout << mostFrequent(arr, n);
    return 0;
}