How to find the ceiling of N in a sorted array with C++

1 Answer

0 votes
#include <iostream>

// ceiling of N = the smallest element in an array greater than or equal to N
 
int find_the_ceiling(int arr[], int size, int N) {
    if (N <= arr[0]) {
        return 0;  
    }
 
    for (int i = 0; i < size; i++) {
        if (arr[i] == N) {
            return i;
        }
        if (arr[i] < N && arr[i + 1] >= 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 = 9;
    
    int index = find_the_ceiling(arr, size, N);
    
    if (index == -1)
        std::cout << "The ceiling of " << " doesn't exist in array";
    else
        std::cout << "The ceiling of " << N << " is " << arr[index];
}
 
 
 
 
/*
run:
 
The ceiling of 9 is 14
     
*/

 

 



answered Jan 19, 2024 by avibootz
edited Jan 19, 2024 by avibootz

Related questions

1 answer 215 views
1 answer 198 views
1 answer 194 views
1 answer 248 views
1 answer 215 views
1 answer 171 views
1 answer 200 views
...