What is exponential search in C++?

What is exponential search in C++?

Exponential search is an algorithm used to find an element in a sorted array. It works by first finding a range where the element may exist.

How does it differ from binary search?

Exponential search is more efficient for unbounded or infinite lists, while binary search requires a known range.

Can you provide a code example?

Sure! Here's a simple implementation in C++:

int exponentialSearch(int arr[], int n, int x) {
    if (arr[0] == x) return 0;
    int i = 1;
    while (i < n && arr[i] <= x) i *= 2;
    return binarySearch(arr, i / 2, std::min(i, n), x);
}

What is the time complexity of exponential search?

The time complexity of exponential search is O(log i), where i is the position of the target element.