template int ternary_search(const ArrayLike& array, const T& value, int low, int high) { // Base case: if (high return -1; low) // General case: int one_third = low + (high - low) / 3; int two_thirds if (array[one_third] > value) { // if we should recurse on the 1st third = low + 2 * (high Low) / 3;

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

Using recurrence relations, solve the big-O of the following. Assume ArrayLike has the same big-O as an array and that comparing T objects to each other is O(1). Show work.


template <typename ArrayLike, typename T>
int ternary_search(const ArrayLike& array, const T& value, int low, int high) {
// Base case:
if (high <= low)
return -1;
// General case:
int one_third
int two_thirds =
if (array[one_third] > value) { // if we should recurse on the 1st third
return ternary_search(array, value, low, one_third);
} else if (array[one_third]
return one_third;
} else if (array[two_thirds] > value) { // if we should recurse on 2nd third
return ternary_search(array, value, one_third + 1, two_thirds);
} else if (array[two_thirds]
return two_thirds;
} else { // else we should recurse on the last third
return ternary_search(array, value, two_thirds + 1, high);
}
}
low + (high - low) / 3;
= low + 2 * (high - low) / 3;
value) { // if value is at the 1st third
==
value) { // if value is at the 2nd third
==
Transcribed Image Text:template <typename ArrayLike, typename T> int ternary_search(const ArrayLike& array, const T& value, int low, int high) { // Base case: if (high <= low) return -1; // General case: int one_third int two_thirds = if (array[one_third] > value) { // if we should recurse on the 1st third return ternary_search(array, value, low, one_third); } else if (array[one_third] return one_third; } else if (array[two_thirds] > value) { // if we should recurse on 2nd third return ternary_search(array, value, one_third + 1, two_thirds); } else if (array[two_thirds] return two_thirds; } else { // else we should recurse on the last third return ternary_search(array, value, two_thirds + 1, high); } } low + (high - low) / 3; = low + 2 * (high - low) / 3; value) { // if value is at the 1st third == value) { // if value is at the 2nd third ==
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 3 images

Blurred answer
Knowledge Booster
Counting Sort
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education