mirror of
https://github.com/TheAlgorithms/JavaScript.git
synced 2025-12-19 06:58:15 +08:00
86d333ee94
* chore: Switch to Node 20 + Vitest * chore: migrate to vitest mock functions * chore: code style (switch to prettier) * test: re-enable long-running test Seems the switch to Node 20 and Vitest has vastly improved the code's and / or the test's runtime! see #1193 * chore: code style * chore: fix failing tests * Updated Documentation in README.md * Update contribution guidelines to state usage of Prettier * fix: set prettier printWidth back to 80 * chore: apply updated code style automatically * fix: set prettier line endings to lf again * chore: apply updated code style automatically --------- Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com> Co-authored-by: Lars Müller <34514239+appgurueu@users.noreply.github.com>
47 lines
1.1 KiB
JavaScript
47 lines
1.1 KiB
JavaScript
/**
|
|
* Interpolation Search
|
|
*
|
|
* Time Complexity:
|
|
* -Best case: O(1)
|
|
* -Worst case: O(n)
|
|
* -O((log(log(n))) If the data are uniformly distributed
|
|
*
|
|
*
|
|
*/
|
|
|
|
export function interpolationSearch(arr, key) {
|
|
const length = arr.length - 1
|
|
let low = 0
|
|
let high = length
|
|
let position = -1
|
|
let delta = -1
|
|
|
|
// Because the array is sorted the key must be between low and high
|
|
while (low <= high && key >= arr[low] && key <= arr[high]) {
|
|
delta = (key - arr[low]) / (arr[high] - arr[low])
|
|
position = low + Math.floor((high - low) * delta)
|
|
|
|
// Target found return its position
|
|
if (arr[position] === key) {
|
|
return position
|
|
}
|
|
|
|
// If the key is larger then it is in the upper part of the array
|
|
if (arr[position] < key) {
|
|
low = position + 1
|
|
// If the key is smaller then it is in the lower part of the array
|
|
} else {
|
|
high = position - 1
|
|
}
|
|
}
|
|
|
|
return -1
|
|
}
|
|
|
|
// const arr = [2, 6, 8, 10, 12, 14, 16, 18, 20, 22, 26, 34, 39]
|
|
|
|
// interpolationSearch(arr, 2)
|
|
// interpolationSearch(arr, 12)
|
|
// interpolationSearch(arr, 1000)
|
|
// interpolationSearch(arr, 39)
|