In retrieving a value from a dictionary data structure that uses a sorted array-based implementation, the worst-case efficiency is:
a) O(1)
b) O(log n)
c) O(n)
d) O(n²)