Left
-
Mid
-
Right
-
>> Algorithm_Execution_Stack
STEPS: 0
while (L <= R) {
mid = L + (R - L) / 2;
if (a[mid] == target) return mid;
if (a[mid] < target) L = mid + 1;
else R = mid - 1;
}