Merge Sort is one of the most efficient sorting algorithms. The key point of the algorithm is splitting a large list to many smaller ones. By splitting a list into smaller lists, sorting them individually, and then merging them back together in order, it takes an average complexity of O(n log n).

For further actions, you may consider blocking this person and/or reporting abuse
Top comments (0)