What is the runtime for determining, through a naïve binary search, whether a string of length m is found in a suffix array of a string of length n?

Answer 1

The runtime for a naïve binary search on a suffix array of a string of length n to determine whether a string of length m is present would be O(mlogn).