Question

The time complexity of any comparison sorting algorithm will be

Answer 1

the time complexity must be written in any type of comparison sorting then their actually r

Answer 2

Answer:

The minimum possible time complexity of a comparison based sorting algorithm is O(nLogn) for a random input array. B. Any comparison based sorting algorithm can be made stable by using position as a criteria when two elements are compared