Published by Dimitris Kougioumtzis · Updated
Inspect two dividing points and retain one third of the sorted search interval. Input is sorted before searching.
Probe two positions in a sorted interval and discard the parts that cannot contain the target.
When to use Ternary search (sorted array)
Comparing binary and ternary subdivision.
Choosing an alternative
Binary search usually uses fewer comparisons on ordinary arrays.
Worked example: input and state changes
Example input
38, 12, 65, 8, 43, 27, 91, 19 | 43
These checkpoints follow the actual example timeline. State details show the stored values and decisions; use the visualization to inspect every intervening step.
Step 0: Initial state.
State at this checkpoint
{ "values": [ 8, 12, 19, 27, 38, 43, 65, 91 ], "active": [] }Step 1: Inspect thirds at 2 and 5.
State at this checkpoint
{ "values": [ 8, 12, 19, 27, 38, 43, 65, 91 ], "active": [ 2, 5 ] }Step 2: Found 43 at index 5.
State at this checkpoint
{ "values": [ 8, 12, 19, 27, 38, 43, 65, 91 ], "active": [ 5 ] }
Expected final state
Found 43 at index 5.
Complexity and input bounds
Family: Searching. Time complexity: O(log n).
Space complexity: O(1) auxiliary space.
Working-space bounds describe algorithm state and any explicitly noted output, excluding the visualization's saved timeline. Recording frames can use more memory than running the function alone. Here n is sequence length, V and E are vertex and edge counts, and other parameters refer to the named input dimensions.
2–24 comma-separated integers between 0 and 99. Follow with | target.
The playground validates these limits before starting. Downloaded functions are callable implementations, with parameter and output-buffer contracts in their comments; they do not all repeat the playground's input validation.
Common mistakes and limitations
This searches a sorted array; it is not ternary optimization over a unimodal function.
Further reading
For background on algorithm analysis and the JavaScript function interface:
- MIT OpenCourseWare: algorithm design and analysis foundations
- MDN: JavaScript function parameters and return values
Editorial and testing approach · Browse all algorithm guides
Complete JavaScript implementation
1 2 3 4 5 6 7 8 9 10 11 12 13 | // Requires ascending input. Returns a found index, or -1. Reference snippets assume validated playground inputs. Fixed scratch buffers have 256 slots. Sorting variants may use a different traversal strategy than the animation. function algorithm(a, n, target) { let l = 0; let r = n - 1; while (l <= r) { let third = Math.floor((r - l) / 3); let m1 = l + third; let m2 = r - third; if (a[m1] == target) { return m1; } if (a[m2] == target) { return m2; } if (target < a[m1]) { r = m1 - 1; } else if (target > a[m2]) { l = m2 + 1; } else { l = m1 + 1; r = m2 - 1; } } return -1; } |
Source
No original paper has been verified for this entry. This source is a reference text or teaching reference, not an asserted original publication.
- The Art of Computer Programming, Volume 3: Sorting and Searching (2nd edition)
Donald E. Knuth (1998). Reference book.