指数拟合算法 回归算法_搜索算法：指数搜索说明

指数拟合算法 回归算法

指数搜索 (Exponential Search)

Exponential Search also known as finger search, searches for an element in a sorted array by jumping 2^i elements every iteration where i represents the value of loop control variable, and then verifying if the search element is present between last jump and the current jump.

指数搜索(也称为手指搜索)，通过在每次迭代中跳过2^i元素(其中i代表循环控制变量的值)来搜索排序数组中的元素，然后验证搜索元素是否位于上一次跳转和当前跳转之间。

复杂性最坏的情况 (Complexity Worst Case)

O(log(N)) Often confused because of the name, the algorithm is named so not because of the time complexity. The name arises as a result of the algorithm jumping elements with steps equal to expone