When extensive time is required to sort integers, this represents what case complexity?
If we assume that all possible permutations of the input list are equally likely, the average time taken for sorting is O(n log n).