So, overall, when given the array size n we perform c (log2 n + 1) operations. Time complexity = O(logn). Binary search analysis using master theorem.
確定! 回上一頁