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

Update jumpSearch.js

Browse Source
This commit is contained in:
Libin Yang
2019-05-11 10:13:32 +08:00
committed by GitHub
parent e92c4ae40a
commit 695ac54df2
1 changed files with 21 additions and 23 deletions
Download Patch File Download Diff File Expand all files Collapse all files

42
Search/jumpSearch.js
View File

@ -5,31 +5,29 @@
* The advantage against binary search is that Jump Search traversed back only once. * The advantage against binary search is that Jump Search traversed back only once.
*/ */
const jumpSearch = (arr, value)=>{ const jumpSearch = (arr, value) => {
const length = arr.length; const length = arr.length;
let step = Math.floor(Math.sqrt(length)); let step = Math.floor(Math.sqrt(length));
let lowerBound = 0; let lowerBound = 0;
while (arr[Math.min(step, length)-1] < value) while (arr[Math.min(step, length) - 1] < value) {
{ lowerBound = step;
lowerBound = step; step += step;
step += step; if (lowerBound >= length) {
if (lowerBound >= length){ return -1;
return -1; }
} }
}
const upperBound = Math.min(step, length); const upperBound = Math.min(step, length);
while (arr[lowerBound] < value) while (arr[lowerBound] < value) {
{ lowerBound++;
lowerBound++; if (lowerBound === upperBound) {
if (lowerBound === upperBound){ return -1;
return -1; }
} }
} if (arr[lowerBound] === value) {
if (arr[lowerBound] === value){ return lowerBound;
return lowerBound; }
} return -1;
return -1;
} }
const arr = [0,0,4,7,10,23,34,40,55,68,77,90] const arr = [0,0,4,7,10,23,34,40,55,68,77,90]
jumpSearch(arr,4); jumpSearch(arr,4);