'selsort'mergesort seconds list size figure experimental comparison of selection sort and merge sort (nempirical testing of these two algorithms confirms this analysis on my computerselection sort beats merge sort on lists up to size about which takes around seconds on larger liststhe merge sort dominates figure shows comparison of the time required to sort lists up to size you can see that the curve for selection sort veers rapidly upward (forming half of parabola)while the merge sort curve looks almost straight (look at the bottomfor itemsselection sort requires over seconds while merge sort completes the task in about of second merge sort can sort list of , items in less than six secondsselection sort takes around minutes that' quite difference hard problems using our divide-and-conquer approach we were able to design good algorithms for the searching and sorting problems divide and conquer and recursion are very powerful techniques for algorithm design howevernot all problems have efficient solutions