mirror of
https://github.com/TheAlgorithms/JavaScript.git
synced 2025-07-05 00:01:37 +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>
87 lines
2.9 KiB
JavaScript
87 lines
2.9 KiB
JavaScript
/* Ternary search is similar to binary search but it divides the sorted array
|
|
* into three parts and determines which part the key lies in. The array will
|
|
* be divided into three intervals by using two middle points, mid1 and mid2.
|
|
* The value of the key will first be compared with the two mid points, the value
|
|
* will be returned if there is a match. Then, if the value of the key is less
|
|
* than mid1, narrow the interval to the first part. Else, if the value of the
|
|
* key is greater than mid2, narrow the interval to the third part. Otherwise,
|
|
* narrow the interval to the middle part. Repeat the steps until the value is
|
|
* found or the interval is empty (value not found after checking all elements).
|
|
*
|
|
* Reference: https://www.geeksforgeeks.org/ternary-search/
|
|
*/
|
|
|
|
function ternarySearchRecursive(arr, key, low = 0, high = arr.length - 1) {
|
|
if (high >= low) {
|
|
// find the mid1 and mid2
|
|
const mid1 = Math.floor(low + (high - low) / 3)
|
|
const mid2 = Math.floor(high - (high - low) / 3)
|
|
|
|
// check if key is found at any mid
|
|
if (arr[mid1] === key) {
|
|
// return index of key if found
|
|
return mid1
|
|
}
|
|
if (arr[mid2] === key) {
|
|
// return index of key if found
|
|
return mid2
|
|
}
|
|
|
|
// since the key is not found at mid,
|
|
// check in which region it is present
|
|
// and repeat the Search operation
|
|
// in that region
|
|
if (key < arr[mid1]) {
|
|
// the key lies in between low and mid1
|
|
return ternarySearchRecursive(arr, key, low, mid1 - 1)
|
|
} else if (key > arr[mid2]) {
|
|
// the key lies in between mid2 and high
|
|
return ternarySearchRecursive(arr, key, mid2 + 1, high)
|
|
} else {
|
|
// the key lies in between mid1 and mid2
|
|
return ternarySearchRecursive(arr, key, mid1 + 1, mid2 - 1)
|
|
}
|
|
} else {
|
|
// if low > high => we have searched the whole array without finding the item
|
|
return -1
|
|
}
|
|
}
|
|
|
|
function ternarySearchIterative(arr, key, low = 0, high = arr.length - 1) {
|
|
while (high >= low) {
|
|
// find the mid1 and mid2
|
|
const mid1 = Math.floor(low + (high - low) / 3)
|
|
const mid2 = Math.floor(high - (high - low) / 3)
|
|
|
|
// check if key is found at any mid
|
|
if (arr[mid1] === key) {
|
|
// return index of key if found
|
|
return mid1
|
|
}
|
|
if (arr[mid2] === key) {
|
|
// return index of key if found
|
|
return mid2
|
|
}
|
|
|
|
// since the key is not found at mid,
|
|
// check in which region it is present
|
|
// and repeat the Search operation
|
|
// in that region
|
|
if (key < arr[mid1]) {
|
|
// the key lies in between low and mid1
|
|
high = mid1 - 1
|
|
} else if (key > arr[mid2]) {
|
|
// the key lies in between mid2 and high
|
|
low = mid2 + 1
|
|
} else {
|
|
// the key lies in between mid1 and mid2
|
|
low = mid1 + 1
|
|
high = mid2 - 1
|
|
}
|
|
}
|
|
// the key was not found
|
|
return -1
|
|
}
|
|
|
|
export { ternarySearchRecursive, ternarySearchIterative }
|