#include <iostream>
// floor of N = the largest element in the array smaller than or equal to N
int find_the_floor(int arr[], int size, int N) {
if (N >= arr[size - 1]) {
return size - 1;
}
if (N < arr[0]) {
return -1;
}
for (int i = 1; i < size; i++) {
if (arr[i] > N) {
return i - 1;
}
}
return -1;
}
int main()
{
int arr[] = {1, 2, 7, 8, 14, 19, 20, 24, 28};
int size = sizeof(arr) / sizeof(arr[0]);
int N = 17;
int index = find_the_floor(arr, size, N);
if (index == -1)
std::cout << "The floor of " << N << " doesn't exist in array";
else
std::cout << "The floor of " << N << " is " << arr[index];
}
/*
run:
The floor of 17 is 14
*/