Answered: Given the following function, what…

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

Related questions

Question

Given the following function, what happens if a[] contains just one element that doesn't match val?

int binarySearch(int a[], int first, int last, int val)
{
if (first > last) return -1;
int middle = (first + last) / 2;
if (a[middle] == val) return middle;
if (a[middle] < val) return binarySearch(a, middle+1, last, val);
else return binarySearch(a, first, middle-1, val);
}

Group of answer choices

binarySearch never calls itself again and terminates (recursion never happens)

binarySearch calls itself once then terminates (recursion happens once)

binarySearch calls itself twice then terminates (recursion happens twice)

binarySearch calls itself 3 times then terminates (recursion happens 3 times)

Expert Solution

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

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