Question

Please explain in detail Compare the efficiency of the Merge Sort and Selection Sort algorithms.

Please explain in detail

Compare the efficiency of the Merge Sort and Selection Sort algorithms.

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

The best,average and worst case complexity of merge sort is O(nlogn)
The best,average and worst case complexity of Selection sort is O(n^2)
so, in terms efficiency merge sort is better compare to selection sort
Merge sort keep on divides the list into two equal halfs, then merges it into sorted list, this process reduces the number of comparisions
selection sort repeatedly finds min from the remaining list, then places it in correct position,leads to higher number of comparisions than merge sort

Add a comment
Know the answer?
Add Answer to:
Please explain in detail Compare the efficiency of the Merge Sort and Selection Sort algorithms.
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