$//$ MERGESORT IMPLEMENTATION:

$//$

void merge$($int data$[],$ size$\_$t n$1,$ size$\_$t n$2)$

$//$ Precondition: data is an array $($or subarray$)$ with at least n$1+$ n$2$ elements.

$//$ The first n$1$ elements $($from data$[0]$ to data$[$n$1-1])$ are sorted from

$//$ smallest to largest, and the last n$2($from data$[$n$1]$ to data$[$n$1+$ n$2-1])$

$//$ also are sorted from smallest to largest.

$//$ Postcondition: The first n$1+$ n$2$ elements of data have been rearranged to be

$//$ sorted from smallest to largest.

$//$ NOTE: If there is insufficient dynamic memory, then bad$\_$alloc is thrown.

$//$ Library facilities used: cstdlib

$\{$

$\}$

void mergesort$($int data$[],$ size$\_$t n$)$

$//$ Precondition: data is an array with at least n components.

$//$ Postcondition: The elements of data have been rearranged so

$//$ that data$[0]<=$ data$[1]<=...<=$ data$[$n$-1].$

$//$ NOTE: If there is insufficient dynamic memory, thenbad$\_$alloc is thrown.

$//$ Library facilities used: cstdlib

$\{$

$\}$

$//*************************************************************************$

$//*************************************************************************$

$//$ QUICKSORT IMPLEMENTATION:

$//$

$//*************************************************************************$

size$\_$t partition$($int data$[],$ size$\_$t n$)$

$\{$

$\}$

void quicksort$($int data$[],$ size$\_$t n$)$

$\{$

$\}$