\nAmong comparison sorts, merge sort and quicksort are both, for average case, order nlogn, which seems about the best you can get with comparison sorts.<\/p>\n
\nWith actual examples I’ve run, quicksort tended to outperform merge sort. However, I’m aware that quicksort’s worst-case performance is order n^2, whereas merge sort’s is nlogn.<\/p>\n
As I understand it, however, the worst case for quicksort is when the input is already sorted and you use the end as a pivot. One can perhaps mitigate this, however, by first using a modified bubble sort, which is of order n when the array is already sorted. Then, if the array is already sorted, you’re done after running the modified bubble sort; if not, you can apply the quicksort.<\/p>\n
Just an idea:)<\/p>\n
creel<\/p>\n Computerphile<\/p>\n cprogramming.com<\/a><\/p>\nJack of Oracle Tutoring by Jack and Diane,<\/a> Campbell River, BC.\n","protected":false},"excerpt":{"rendered":" Self-tutoring about computer science: the tutor mentions a thought about using sorting algorithms. Among comparison sorts, merge sort and quicksort are both, for average case, order nlogn, which seems about the best you can get with comparison sorts. With actual …<\/p>\n