write a c++ project that takes user input array and merge sort it.

then answer this 2 questions If possible: whats the run time of find median use median of medians algorithm to pick pivot?

at what point (number of element in the array) does merge sort run faster?