Consider the following method. // precondition: arr contains no duplicates; //               the elements in arr are in sorted order; //               0 ≤ low ≤ arr.length; low - 1 ≤ high < arr.length public static int mystery(int[] arr, int low, int high, int num) {   int mid = (low + high) / 2;     if (low > high)   {     return low;   }   else if (arr[mid] < num)   {     return mystery(arr, mid + 1, high, num);   }   else if (arr[mid] > num)   {     return mystery(arr, low, mid - 1, num);   }   else // arr{mid] == num   {     return mid;       } } How many calls to mystery (including the initial call) are made as a result of the callmystery(arr, 0, arr.length - 1, 14) if arr is the following array?   0 1 2 3 4 5 6 7 arr 11 13 25 26 29 30 31 32   A) 1 B) 2 C) 4 D) 7 E) 8

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

Consider the following method.

// precondition: arr contains no duplicates;

//               the elements in arr are in sorted order;

//               0 ≤ low ≤ arr.length; low - 1 ≤ high < arr.length

public static int mystery(int[] arr, int low, int high, int num)

{

  int mid = (low + high) / 2;

 

  if (low > high)

  {

    return low;

  }

  else if (arr[mid] < num)

  {

    return mystery(arr, mid + 1, high, num);

  }

  else if (arr[mid] > num)

  {

    return mystery(arr, low, mid - 1, num);

  }

  else // arr{mid] == num

  {

    return mid;

      }

}

How many calls to mystery (including the initial call) are made as a result of the callmystery(arr, 0, arr.length - 1, 14) if arr is the following array?

  0 1 2 3 4 5 6 7
arr 11 13 25 26 29 30 31 32

 

A) 1

B) 2

C) 4

D) 7

E) 8

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Knowledge Booster
Time complexity
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