Read the following codes and then answer questions: int binsrch (int a[], int x, int low,...

Transcribed Image Text:

Read the following codes and then answer questions: int binsrch (int a[], int x, int low, int high) // the low and high are the first and last indexes of a[] { } int mid; if (low > high) return (-1); mid = (low + high) /2; return (x == a [mid]? mid : x < a[mid] ? binsrch (a, x, low, mid 1): binsrch (a, x, mid + 1, high)); 1. What are the purpose of the function? 2. Explain why a recursive function must have a stop condition. 3. What is the stop condition(s) for this recursive function? Read the following codes and then answer questions: int binsrch (int a[], int x, int low, int high) // the low and high are the first and last indexes of a[] { } int mid; if (low > high) return (-1); mid = (low + high) /2; return (x == a [mid]? mid : x < a[mid] ? binsrch (a, x, low, mid 1): binsrch (a, x, mid + 1, high)); 1. What are the purpose of the function? 2. Explain why a recursive function must have a stop condition. 3. What is the stop condition(s) for this recursive function?

Answer rating: 100% (QA)

This code is a binary search function implemented using recursion to find an element x in a sorted a... View the full answer