Question

Assume that the following 8 numbers are elements of an array (7pt). 8, 7, 6, 5,...

Assume that the following 8 numbers are elements of an array (7pt).

8, 7, 6, 5, 4, 3, 2, 1.

  1. Sort the array in ascending order by applying Merge sort, and show how the array looks after each step.
  2. Is merge sort has every-case time complexity? If your answer is yes, what is its every-case time complexity?
  3. If your answer is no, what is its worst case time complexity and at what condition it will have worst-case time complexity?
  4. If your answer is no, what is its best- case time complexity and at what   condition it will have best-case tie complexity?
0 0
Add a comment Improve this question Transcribed image text
Answer #1

sub parts c and d are not required in merge sort

Because time complexity in all cases are equal O(nlogn)

Anything doubtful or not understand or missing just comment

Don't be dislike

Thank you and all the best

Add a comment
Know the answer?
Add Answer to:
Assume that the following 8 numbers are elements of an array (7pt). 8, 7, 6, 5,...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT