How is merge sort accomplished?
The original list is broken into two groups, then sorted from there.
The original list is continuously broken up into sublists until each sublist is containts 1 element, then the sublists are combined together.
If there are an even number of elements, the list is broken into two groups, are sorted, then merged back together. If there are odd numbered elements, the list is broken into three groups.
Each element in the list is compared to all the other elements and inserted where it fits.
The orginal list is broken into sublists of 4, then are combined together.
The above diagram represents what type of sorting algorithm?
Bubblesort
Insertion sort
Mergesort
Quicksort
Selection sort
