In math logic:what is time for sorting?

Question

In math logic:what is time for sorting?

Answer 1

There are sort algorithms like Quicksort that

sort in a time proportional to n log(n) when

there are n items to sort.  That is very fast,

much faster than the time O(n²) of easy

sort algorithms.