C# Program for Ceiling in a sorted array
Last Updated :
15 Feb, 2023
Given a sorted array and a value x, the ceiling of x is the smallest element in array greater than or equal to x, and the floor is the greatest element smaller than or equal to x. Assume than the array is sorted in non-decreasing order. Write efficient functions to find floor and ceiling of x.
Examples :
For example, let the input array be {1, 2, 8, 10, 10, 12, 19}
For x = 0: floor doesn't exist in array, ceil = 1
For x = 1: floor = 1, ceil = 1
For x = 5: floor = 2, ceil = 8
For x = 20: floor = 19, ceil doesn't exist in array
In below methods, we have implemented only ceiling search functions. Floor search can be implemented in the same way.
Method 1 (Linear Search)
Algorithm to search ceiling of x:
1) If x is smaller than or equal to the first element in array then return 0(index of first element)
2) Else Linearly search for an index i such that x lies between arr[i] and arr[i+1].
3) If we do not find an index i in step 2, then return -1
C#
using System;
class GFG {
static int ceilSearch( int [] arr, int low,
int high, int x)
{
int i;
if (x <= arr[low])
return low;
for (i = low; i < high; i++) {
if (arr[i] == x)
return i;
if (arr[i] < x && arr[i + 1] >= x)
return i + 1;
}
return -1;
}
public static void Main()
{
int [] arr = { 1, 2, 8, 10, 10, 12, 19 };
int n = arr.Length;
int x = 3;
int index = ceilSearch(arr, 0, n - 1, x);
if (index == -1)
Console.Write( "Ceiling of " + x +
" doesn't exist in array" );
else
Console.Write( "ceiling of " + x +
" is " + arr[index]);
}
}
|
Output :
ceiling of 3 is 8
Time Complexity : O(n)
Auxiliary Space: O(1)
As constant extra space is used.
Method 2 (Binary Search)
Instead of using linear search, binary search is used here to find out the index. Binary search reduces time complexity to O(Logn).
C#
using System;
class GFG {
static int ceilSearch( int [] arr, int low,
int high, int x)
{
int mid;
if (x <= arr[low])
return low;
if (x > arr[high])
return -1;
mid = (low + high) / 2;
if (arr[mid] == x)
return mid;
else if (arr[mid] < x) {
if (mid + 1 <= high && x <= arr[mid + 1])
return mid + 1;
else
return ceilSearch(arr, mid + 1, high, x);
}
else {
if (mid - 1 >= low && x > arr[mid - 1])
return mid;
else
return ceilSearch(arr, low, mid - 1, x);
}
}
public static void Main()
{
int [] arr = { 1, 2, 8, 10, 10, 12, 19 };
int n = arr.Length;
int x = 8;
int index = ceilSearch(arr, 0, n - 1, x);
if (index == -1)
Console.Write( "Ceiling of " + x +
" doesn't exist in array" );
else
Console.Write( "ceiling of " + x +
" is " + arr[index]);
}
}
|
Output :
Ceiling of 20 doesn't exist in array
Time Complexity: O(Logn)
Auxiliary Space: O(Logn)
The extra space is used in recursive call stack.
Related Articles:
Floor in a Sorted Array
Find floor and ceil in an unsorted array
Please write comments if you find any of the above codes/algorithms incorrect, or find better ways to solve the same problem, or want to share code for floor implementation.
Please refer complete article on Ceiling in a sorted array for more details!
Share your thoughts in the comments
Please Login to comment...