Question

[3 marks] Describe conditions under which an implementation of Quicksort would be slower than a good implementation of Merge

0 0
Add a comment Improve this question Transcribed image text
Answer #1

When input array is sorted or reverse sorted in this case the complexity becomes O(n2) .because in this pivot choosen is either greatest or smallest item.This can be avoided if pivot is randomly choosen but there is no stability in quicksort. In case of merge sort its worst alwatys takes O(n*logn).

NOTE: I TRIED TO IMPLEMENT THE REQUESTED PROBLEM AS PER BEST OF MY UNDERSTANDING....IF YOU NEED ANY SORT OF HELP REGARDING THIS PROBLEM , PLEASE DO MENTION IN COMMENTS.....IF YOU GOT ANY SORT OF HELP THROUGH THIS ARTICLE PLEASE DO UPVOTE.....THANKYOU!!!

Add a comment
Know the answer?
Add Answer to:
[3 marks] Describe conditions under which an implementation of Quicksort would be slower than a good...
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