algorithm/JavaScript
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/JavaScript.git synced 2025-07-05 16:26:47 +08:00
Code Issues Packages Projects Releases Wiki Activity

Fixed exponentialSearch.js and interpolationSearch.js

Browse Source
This commit is contained in:
LefterisD
2020-08-10 21:06:58 +03:00
parent 6dbb849911
commit a47923d210
2 changed files with 70 additions and 76 deletions
Download Patch File Download Diff File Expand all files Collapse all files

65
Search/InterpolationSearch.js
View File

@ -1,49 +1,46 @@
/*
/**
* Interpolation Search
*
*
* Time Complexity:
* -Best case: O(1)
* -Worst case: O(n)
* -O((log(log(n))) If the data are uniformly distributed
*
*
*
*/
function interpolationSearch(arr, key) {
function interpolationSearch (arr, key) {
const length = arr.length - 1
let low = 0
let high = length
let position = -1
let delta = -1
let 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)
//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;
}
// Target found return its position
if (arr[position] === key) {
return position
}
return -1;
// 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]
let arr = [2, 6, 8, 10, 12, 14, 16, 18, 20, 22, 26, 34, 39];
console.log("Found at position :" + interpolationSearch(arr, 2));
console.log("Found at position :" + interpolationSearch(arr, 12));
console.log("Found at position :" + interpolationSearch(arr, 1000));
console.log("Found at position :" + interpolationSearch(arr, 39));
console.log('Found at position :' + interpolationSearch(arr, 2))
console.log('Found at position :' + interpolationSearch(arr, 12))
console.log('Found at position :' + interpolationSearch(arr, 1000))
console.log('Found at position :' + interpolationSearch(arr, 39))