Merge Sort §

Group: 5 #group-5

Relations §

• Sorting: Merge Sort is a divide and conquer algorithm that recursively divides the input array into two halves, sorts them, and then merges them.