Suppose we do merge sort with a three-way split: divide the array into 3 equal parts, sort each part and do a 3 way merge. What would the worst-case complexity of this version be?
What is the worst case complexity of selection sort? Is it theta (n) or theta (n^2)? How?