Consider a recursive implementation of merge sort which is used to sort an array of size n . What is the number of recursive calls made to merge sort ?
Consider a recursive implementation of Merge Sort which is used to sort an array of size n . What is the number of recursive calls made to Merge Sort : O -LRB- n -RRB- but not Theta -LRB- n -RRB- , Theta -LRB- n -RRB- , O -LRB- n log n -RRB- but not Theta -LRB- n log n -RRB- or Theta ?