In a standard merge sort algorithm on a list of size n (n>1), what is the minimum number of times an item can be compared in best case?
1
1
2
log n
3
n/2
4
n-1
In a standard merge sort algorithm on a list of size n (n>1), what is the minimum number of times an item can be compared in best case?