[WEBINAR] The New Normal: Dealing with the Reality of an Unsecure World

Ternary Search

Definition - What does Ternary Search mean?

In computer science and advanced mathematics, a ternary search is a search algorithm that uses a "divide and conquer" strategy to isolate a particular value. It is similar to a binary search, but it divides the search data structure into three parts instead of two.

Techopedia explains Ternary Search

Divide-and-conquer algorithms work recursively. Through repetitive operations, the algorithm narrows the search field (i.e., the search data structure) in order to isolate the search value. In a ternary search, the algorithm divides the search field into thirds and isolates the minimum or maximum value from two of those thirds. Working recursively, the algorithm can isolate the search value if it exists. For example, out of 30 available end nodes, a first-order ternary search would narrow the field from 30 to 10, and a second-level search would narrow it further from 10 to 3 or 4.

Techopedia Deals

Connect with us

Techopedia on Linkedin
Techopedia on Linkedin
"Techopedia" on Twitter

Sign up for Techopedia's Free Newsletter!

Email Newsletter

Join thousands of others with our weekly newsletter

Free Whitepaper: The Path to Hybrid Cloud
Free Whitepaper: The Path to Hybrid Cloud:
The Path to Hybrid Cloud: Intelligent Bursting To Amazon Web Services & Microsoft Azure
Free E-Book: Public Cloud Guide
Free E-Book: Public Cloud Guide:
This white paper is for leaders of Operations, Engineering, or Infrastructure teams who are creating or executing an IT roadmap.
Free Tool: Virtual Health Monitor
Free Tool: Virtual Health Monitor:
Virtual Health Monitor is a free virtualization monitoring and reporting tool for VMware, Hyper-V, RHEV, and XenServer environments.
Free 30 Day Trial – Turbonomic
Free 30 Day Trial – Turbonomic:
Turbonomic delivers an autonomic platform where virtual and cloud environments self-manage in real-time to assure application performance.