Numéro 4. (15 pts) Consider an array t of size n indexed from 1 to n containing integers sorted

in ascending order. The array is such that the elements of indices m + 1 to n are all equal to z and

Page 4

that t[i]

array t, y < r with complexity O(log m) and not O(logn) given that the value of m is unknown.

Response: