What is the time complexity of the best$-$known algorithm for sorting an arbitrary list of elements in ascending order?

$O(n)$

$O(nlogn)$

$O(n^{{?}^{{?}^{?}}}2)$

$O(logn)$