{"id":16135,"date":"2023-05-05T12:13:24","date_gmt":"2023-05-05T12:13:24","guid":{"rendered":"https:\/\/www.prepbytes.com\/blog\/?p=16135"},"modified":"2023-05-05T12:13:24","modified_gmt":"2023-05-05T12:13:24","slug":"cpp-program-to-find-the-frequency-of-elements-in-an-array","status":"publish","type":"post","link":"https:\/\/prepbytes.com\/blog\/cpp-program-to-find-the-frequency-of-elements-in-an-array\/","title":{"rendered":"CPP Program to Find the Frequency of Elements in An Array"},"content":{"rendered":"

\"\"<\/p>\n

For each unique element in the array, we must count its occurrence in this program. Maintaining one array to hold the counts of each array element is one strategy for solving this issue. As you loop through the array, count how often each element appears and then store the results in another array.<\/p>\n

arr = {1, 2, 3, 5, 2, 9, 7, 3, 5}<\/code><\/pre>\n
In the above example, 1 appeared 1 time, 2 appeared 2 times, 3 appeared 2 times, 5 occurs 2 times, 7 occurs 1 time, and 9 occurs 1 time.<\/p>\n
Methods to Find the Frequency of Elements in An Array<\/h2>\n
There are different methods to find the frequency of elements in an array :<\/p>\n
Method 1 To Find the Frequency of Elements in an Array With Extra Space<\/h3>\n
To find the frequency of elements in an array, we will use two loops and we will count the frequency of each element.<\/p>\n
    \n
  • Step 1:<\/strong> Create an array of size n in order to check the status of the visited items.<\/li>\n
  • Step 2:<\/strong> From index 0 to index n, loop over the elements and skip the ones where (visited[i]==1).<\/li>\n
  • Step 3:<\/strong> Make the variable count = 1 to maintain the frequency count.<\/li>\n
  • Step 4:<\/strong> Continually loop from index i+1 to n.<\/li>\n
  • Step 5:<\/strong> Determine whether arr[i]==arr[j], then add 1 to the count and set visited[j]=1.<\/li>\n
  • Step 6:<\/strong> Print the element and the value of the count once the for loop has finished iterating.<\/li>\n<\/ul>\n
    Code Implementation<\/strong><\/p>\n\t\t\t\t\t\t