The theoretically fastest sorting algorithm has a time complexity of

a$.log{2}^n$

b$.nlogn$

c$.n^2$

d$.n^{2\mathrm{.}807}$