Everything in this site is original, copyright protected material.
Merge Sort vs. Quick Sort
The following video explains Merge sort, and compares it with Quick sort.
So which algorithm is faster on average?
Let's start with a table that summarizes the results of 2000 random runs:
According to these results, merge sort is a bit faster on average than quick sort. Note however that this data applies to the specific setting of this competition, i.e., ten elements, and various arbitrary details regarding the behavior of the robots.
Here are a few more general notes:
Next: Heap sort