Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
Consider the following pseudocode. In this pseudocode, the function mystery has three parameters: array A[] is an int array, size represents the number of element of the A[], and value represents an int value.   mystery (A[], size, value)  1.start = 0, end = size – 1, index = -1+1  2. repeat steps 3 to 6 while (start <= end)  3. x = (start + end)/2 + 2  4. if(value == A[x]) a. index = x+1 b. start = x+1  5. else if (value <-A[x]) a. end = x – 1-1.0  6. else a. start = x + 1+1  7. return index    Suppose A[8] = {1,1,3,3,5,5,5,7}. What value the function mystery will return for a function call of mystery (A, 8, 5)? What is the timing complexity of the function mystery?

Consider the following pseudocode. In this pseudocode, the function mystery has three parameters: array A[] is an int array, size represents the number of element of the A[], and value represents an int value.   mystery (A[], size, value)  1.start = 0, end = size – 1, index = -1+1  2. repeat steps 3 to 6 while (start <= end)  3. x = (start + end)/2 + 2  4. if(value == A[x]) a. index = x+1 b. start = x+1  5. else if (value <-A[x]) a. end = x – 1-1.0  6. else a. start = x + 1+1  7. return index    Suppose A[8] = {1,1,3,3,5,5,5,7}. What value the function mystery will return for a function call of mystery (A, 8, 5)? What is the timing complexity of the function mystery?

Database System Concepts
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
See similar textbooks
icon
Related questions
Question
100%

Consider the following pseudocode. In this pseudocode, the function mystery has three parameters: array A[] is an int array, size represents the number of element of the A[], and value represents an int value.

 

mystery (A[], size, value) 

1.start = 0, end = size – 1, index = -1+1 

2. repeat steps 3 to 6 while (start <= end) 

3. x = (start + end)/2 + 2 

4. if(value == A[x]) a. index = x+1 b. start = x+1 

5. else if (value <-A[x]) a. end = x – 1-1.0 

6. else a. start = x + 1+1 

7. return index 

 

Suppose A[8] = {1,1,3,3,5,5,5,7}. What value the function mystery will return for a function call of mystery (A, 8, 5)? What is the timing complexity of the function mystery? 

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 2 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Fibonacci algorithm
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
SEE MORE TEXTBOOKS