This is a C++ question on algorithm analysis, searching andsorting: The Big-Oh characterization, in terms of \( \mathrm{N} \), of the running time shown in the following code fragment is Algorithm \( \operatorname{Ex5}(A, B) \) : Input: Arrays \( A \) and \( B \) each 1 answer