Problem1 Write a recursive version of the binary search function to find if x is

Question

Problem1 Write a recursive version of the binary search function to find if x is in A.
Assume that the signature of the function is

bool binary_search(const vector & A, const T & x, int minIndex, int maxIndex)
Problem2 Explain why recursjion should never be used as a substitute for a simple for loop?
Problem1 Write a recursive version of the binary search function to find if x is in A.
Assume that the signature of the function is

bool binary_search(const vector & A, const T & x, int minIndex, int maxIndex)
Problem2 Explain why recursjion should never be used as a substitute for a simple for loop?

Explanation / Answer

please rate - thanks this should get you started. I've never seen it done as a boolean

Related Questions

Navigate

• Browse (All)
• Browse P
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.