In C++ I need this taken care of...

First Write an in-place merge sort algorithm that does not require a temporary array to merge the two halves. Print what efficiency is the solution?

Then display the running time of the sorts described in this chapter which are The Selection Sort, The Bubble Sort, The Insertion Sort, The Merge Sort, The Quick Sort and The Radix Sort. Test the sorts on arrays of various sizes. Arrays of the same size should contain identical entries. Use the function clock from to time each sort.