Binary search

a$)$ has logarithmic time complexity,

b$)$ has a best$-$case time complexity,

c$)$ is intractable,

d$)$ was classified as a search algorithm, e$)$ none of these choices.