Mergesort - What does it mean?
mergesort | |
(computing) A divide and conquer sorting algorithm that operates by dividing]] the items to be sorted into many small lists and gradually [[merge, merging them together.
The difference between mergesort and is: