+ 1
They are different, they can all be best under different conditions. Merge sort is consistentlyâ very good in most cases. Quick sort might be quicker sometimes (implementationâ depending), but can sometimesâ be much slower (not often in real cases). Quick sort uses much less memory than merge sort, so can be better for large data sets. Radix sort is a different type so it's harder to make a comparison, but it can be much quicker the others under specific circumstances. Normally you have to know about your data before you sort it.
If you want to know more then look up big O notation and time complexity, then the details of the algorithmsâ.