Sample Data Structures Questions Chapter 13 Sorting

provide correct short answer in c++

10. Implement the following function:

void merge(int data[ ], size_t n1, size_t n2);

// Precondition: The first n1 elements of data are sorted, and the next n2 elements of data are sorted (from smallest to largest).

// Postcondition: The n1+n2 elements of data are now completely sorted.

14. Suppose that you implement quick sort non-recursively using a stack, as in your last programming assignment. You use your algorithm to sort an array of 100 items, and at the start of the final iteration of the while loop, the stack contains just two numbers: 10 (on top) and 90 (on bottom). Write one or two clear sentences to describe which parts of the array are sorted at this point, and which parts of the array remain to be sorted.