The minimum possible time complexity of a comparison$-$based sorting algorithm is O$($n$($log$($n$))$ for a random input array

Select one:

True

False