KnowledgeHub
Questions
Tags
Users
Search
Alex Rivera
|
Logout
Edit Question
Title
Body
I have read that quicksort is much faster than mergesort in practice, and the reason for this is the hidden constant. Well, the solution for the randomized quick sort complexity is 2nlnn=1.39nlogn which means that the constant in quicksort is 1.39. But what about mergesort? What is the constant in mergesort?
Tags (comma-separated)
Save Edits
Cancel