{"post":"

$\"\"$

Finding the most frequently occurring element in an array is a common array operation with multiple applications. For instance, it can be used to determine:

\n
The most common marks scored by a class in a subject.
\n
\n
The mode of ungrouped data.
\n

This program can be implemented either with or without functions, but using functions improves modularity.

Algorithm

1. Input the array size from the user.

2. Input the array elements.

3. Define a function frequent_element that takes the array and its size as parameters.

4. Use nested loops to:

- Count occurrences of each element.

- Track the maximum occurrence count.

5. Check if multiple elements have the same maximum frequency.

6. Print the result(s).

Code

\n#include <bits/stdc++.h>\n\nusing namespace std;\n\nvoid frequent_element(int arr[], int n) {\n\n    int max_count = 0;\n\n    // Find the maximum occurrence count\n\n    for (int i = 0; i < n; i++) {\n\n        int count = 1;\n\n        for (int j = i + 1; j < n; j++) {\n\n            if (arr[i] == arr[j]) count++;\n\n        }\n\n        if (count > max_count) max_count = count;\n\n    }\n\n    // Print all elements with max_count occurrences\n\n    cout << \"\\nMost frequent number(s): \";\n\n    for (int i = 0; i < n; i++) {\n\n        int count = 1;\n\n        for (int j = i + 1; j < n; j++) {\n\n            if (arr[i] == arr[j]) count++;\n\n        }\n\n        if (count == max_count) {\n\n            cout << arr[i] << \" \";\n\n        }\n\n    }\n\n    cout << endl;\n\n}\n\nint main() {\n\n    int arr[100], n;\n\n    cout << \"Enter array size: \";\n\n    cin >> n;\n\n    cout << \"Enter array elements:\\n\";\n\n    for (int i = 0; i < n; i++) {\n\n        cout << \"Element \" << i + 1 << \": \";\n\n        cin >> arr[i];\n\n    }\n\n    cout << \"Original array: \";\n\n    for (int i = 0; i < n; i++) {\n\n        cout << arr[i] << \" \";\n\n    }\n\n    frequent_element(arr, n);\n\n    return 0;\n\n}\n\n

Output

\nEnter array size: 8\n\nEnter array elements:\n\nElement 1: 3\n\nElement 2: 43\n\nElement 3: 2\n\nElement 4: 3\n\nElement 5: 21\n\nElement 6: 3\n\nElement 7: 43\n\nElement 8: 5\n\nOriginal array: 3 43 2 3 21 3 43 5\n\nMost frequent number(s): 3\n\n

Finding the Mode of Ungrouped Data

Mode is a measure of central tendency that identifies the most frequently occurring value in a dataset, particularly useful for categorical data.

Code

\n#include <bits/stdc++.h>\n\nusing namespace std;\n\nvoid find_mode(int arr[], int n) {\n\n    int max_count = 0;\n\n    // Find maximum frequency\n\n    for (int i = 0; i < n; i++) {\n\n        int count = 1;\n\n        for (int j = i + 1; j < n; j++) {\n\n            if (arr[i] == arr[j]) count++;\n\n        }\n\n        if (count > max_count) max_count = count;\n\n    }\n\n    // Print all modes\n\n    cout << \"\\nMode(s): \";\n\n    for (int i = 0; i < n; i++) {\n\n        int count = 1;\n\n        for (int j = i + 1; j < n; j++) {\n\n            if (arr[i] == arr[j]) count++;\n\n        }\n\n        if (count == max_count) {\n\n            cout << arr[i] << \" \";\n\n        }\n\n    }\n\n    cout << endl;\n\n}\n\nint main() {\n\n    int arr[100], n;\n\n    cout << \"Enter data size: \";\n\n    cin >> n;\n\n    cout << \"Enter data elements:\\n\";\n\n    for (int i = 0; i < n; i++) {\n\n        cout << \"[\" << i << \"]: \";\n\n        cin >> arr[i];\n\n    }\n\n    cout << \"Entered data: \";\n\n    for (int i = 0; i < n; i++) {\n\n        cout << arr[i] << \" \";\n\n    }\n\n    find_mode(arr, n);\n\n    return 0;\n\n}\n\n

Output

\nEnter data size: 8\n\nEnter data elements:\n\n[0]: 45\n\n[1]: 32\n\n[2]: 34\n\n[3]: 26\n\n[4]: 55\n\n[5]: 41\n\n[6]: 55\n\n[7]: 27\n\nEntered data: 45 32 34 26 55 41 55 27\n\nMode(s): 55\n\n

Summary

We demonstrated how to find the most frequent element in an array using basic search operations. The same logic was extended to calculate the mode of ungrouped data. This approach efficiently handles categorical data analysis.

\n","title":"Find The Most Frequent Element in an Array","authorDetails":{"name":"Ananya Pandey","slug":"ananya-pandey"},"description":"Learn how to find the element that occurs most frequently in an array using C++. This program demonstrates how to use a loop and a map data structure to keep track of the frequency of each element in the array.","slug":"cpp/examples/find-most-frequent-element-in-array/","articleId":"636a83417bb1ce5072622af2","bookmarkStatus":{"isBookmarked":false,"bookmarkId":null}}