Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
Physics
Chemistry
Biology
Mathematics
English
Economics
Psychology
Social Studies
Fashion Studies
Legal Studies
- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who
Find frequency of smallest value in an array in C++
Here we will see how to find the frequency of smallest element in an array. Suppose the array elements are [5, 3, 6, 9, 3, 7, 5, 8, 3, 12, 3, 10], here smallest element is 3, and the frequency of this element is 4. So output is 4.
To solve this we will find the smallest element of the list, then we count the occurrences of first numbers, and that will be the result.
Example
#include<iostream>
using namespace std;
int min_element(int arr[], int n){
int min = arr[0];
for(int i = 1; i<n; i++){
if(arr[i] < min)
min = arr[i];
}
return min;
}
int smallestNumFreq(int *arr, int n) {
int minimum = min_element(arr, n);
int count = 0;
for(int i = 0; i < n; i++){
if(arr[i] == minimum)
count++;
}
return count;
}
int main() {
int arr[] = {5, 3, 6, 9, 3, 7, 5, 8, 3, 12, 3, 10};
int n = sizeof(arr) / sizeof(arr[0]);
cout << "Frequency of smallest element: " << smallestNumFreq(arr, n);
}Output
Frequency of smallest element: 4
Updated on: 01-Nov-2019
304 Views
Advertisements