Merge Sort is based on the divide-and-conquer principle, where the array is divided into halves, sorted, and then merged.