I have a set of numbers:
23690 24009 23976 23827 23751 23787 23932 23914 23903 23956 23937 23942 23909 23952
and I'm trying to find the amount of times that the numbers go below 24000.
I have tried this:
void findBelow(const int arr[], int count)
{
int n = sizeof&(arr) / sizeof(arr[0]);
count = 0;
const int threshold = 24000;
for (int i = 0; i < n; i++)
{
if (arr[i] < threshold)
{
count++;
}
}
cout << "Count = "<< count;
}
But it doesn't output the correct amount of numbers.