Could anyone explain this? Thank you in advance! Image transcription textConsidering a random input array, O(n log n) would be the best comp

Could anyone explain this? Thank you in advance! Image transcription textConsidering a random input array, O(n log n) would be the best complexity for a sorting algorithm (consideringthe algorithms we’ve learned). O True O False… Show moreCould anyone explain this? Thank you in advance! Computer Science Engineering & Technology Java Programming CSSE 2002 Share QuestionEmailCopy link