The number of comparisons needed to merge-sort a list of n elements is

1.10 The number of comparisons needed to merge-sort a list of n elements is
A) O(n log n)
B) O(n log log n)
C) O(n)
D) O(n log n2 )

Leave a Reply