-
Notifications
You must be signed in to change notification settings - Fork 0
/
UpperBoundSearch.c
50 lines (43 loc) · 1.5 KB
/
UpperBoundSearch.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
#include <stdio.h>
/**
* Finds the upper bound index of the target element in a sorted array.
* Upper bound is the rightmost index where the target element is present.
* If the target element is not found, returns the index where it could be inserted maintaining the sorted order.
*
* Time Complexity: O(log(n)), where n is the number of elements in the array.
* Binary search is applied iteratively to find the upper bound, which has a time complexity of O(log(n)).
*
* @param array : The sorted array to search in.
* @param begin : The starting index of the subarray to search within.
* @param end : The ending index of the subarray to search within.
* @param checkElement : The element to search for within the array.
*
* @return : The index of the found element if present, otherwise the index where it could be inserted.
*/
int upperBoundBinarySearch(int array[], int begin, int end, int checkElement);
int main()
{
return 0;
}
int upperBoundBinarySearch(int array[], int begin, int end, int checkElement)
{
int result = -1, middle = 0;
while (begin <= end)
{
middle = begin + ((end - begin) / 2); // ((end + begin) / 2)
if (array[middle] == checkElement)
{
result = middle;
begin = middle + 1; // Keep searching for rightmost occurrence
}
else if (array[middle] < checkElement)
{
begin = middle + 1;
}
else if (array[middle] > checkElement)
{
end = middle - 1;
}
}
return result;
}