Question: 3. If the input is a sorted array with n elements in ascending order, what is the big O notation of Merge Sort? Why?
3. If the input is a sorted array with n elements in ascending order, what is the big O notation of Merge Sort? Why? (20 points) MERGE-SORT(A. p.r) 1 if p
Step by Step Solution
There are 3 Steps involved in it
Answer The Merge Sort algorithm has a time complexity of On log n where n is th... View full answer
Get step-by-step solutions from verified subject matter experts
