0The time complexity of binary search on a sorted array of n elements is:AO(n)BO(log n)CO(n log n)DO(n²) Correct answer: B Join the discussion Report an error Share