Book edition 7th

Author(s) Kenneth H. Rosen

Pages 808 pages

ISBN 9780073383095

Answers without the blur.

Just sign up for free and you're in.

Short Answer

The ternary search algorithm locates an element in a list of increasing integers by successively splitting the list into three sublists of equal (or as close to equal as possible) size, and restricting the search to the appropriate piece. Specify the steps of this algorithm.

The ternary search algorithm is given as:

\user1 procedure ternary search ( $x_{1}, x_{2}, . . . ., x_{n}$ integers with $n \geq 1, a$ integer)

$v : = 1 y : = m$

\user1while $v < y - 1$

Algorithm will return $l o c a t i o n$ , which is the position of searched element in the list.

See the step by step solution

Step by Step Solution

TABLE OF CONTENTS :

TABLE OF CONTENTS

Step 1: Algorithm

Algorithm for Binary Search:

\user1 procedure binary search ( a : integer, $x_{1}, x_{2}, . ., x_{n} : i n c r e a \sin g$ )

$i : = 1$ {i is left endpoint of search interval}

$j : = n$ { j is right endpoint of search interval}

\user1while $i < j$

Step 2: convert binary search to ternary search

Make changes in,

\user1while $i < j$

First change is divide using 3 instead of dividing by 2 .

The algorithm based on above conditions given as:

\user1 procedure ternary search ( $x_{1}, x_{2}, . . ., x_{n}$ integers with $n \geq 1, a :$ integer)

$v : = 1 y : = m$

\user1while $v < y - 1$

Find Study Materials for

Create Study Materials

Select your language

Discrete Mathematics and its Applications

Answers without the blur.

Short Answer

The ternary search algorithm locates an element in a list of increasing integers by successively splitting the list into three sublists of equal (or as close to equal as possible) size, and restricting the search to the appropriate piece. Specify the steps of this algorithm.

Step by Step Solution

Step 1: Algorithm

Step 2: convert binary search to ternary search

Most popular questions for Math Textbooks

Want to see more solutions like these?

Recommended explanations on Math Textbooks

Select your language

Discrete Mathematics and its Applications

Answers without the blur.

Short Answer

The ternary search algorithm locates an element in a list of increasing integers by successively splitting the list into three sublists of equal (or as close to equal as possible) size, and restricting the search to the appropriate piece. Specify the steps of this algorithm.

Step by Step Solution

Step 1: Algorithm

Step 2: convert binary search to ternary search

Most popular questions for Math Textbooks

Want to see more solutions like these?

Recommended explanations on Math Textbooks

Decision Maths

Calculus

Probability and Statistics

Statistics

Mechanics Maths

Geometry

Pure Maths