Question: 2) From the following algorithm (binary search) it shows its complexity posing the recurrence equation. int busca (inicio, fin){ if (inicio > fin) return -1;

2) From the following algorithm (binary search) it shows its complexity posing the recurrence equation. int busca (inicio, fin){ if (inicio > fin) return -1; else mitad = (inicio + fin) / 2; if (x == arreglo[mitad]) return mitad; else if (x
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
