Mergesort is the most efficient sorting algorithm O(n logn) that works by recursively splitting an array in half down to only one element, then works back up by comparing adjacent values, and swapping if necessary.