+ 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​.
17th Apr 2018, 9:14 AM
Jared Bird
Jared Bird - avatar