Help with merge sort using vectors // cmpInt() - comparison function for two ints // returns -/0/+ as a is less than/equal to/greater than b int cmpInt(const int& a, const int& b) { return a - b; }

// MergeSort(): sort the values in the data vector using a Merge Sort

// data - vector to be sorted

// first & last - first and last indices to be sorted

// (makes it possible to sort a sub-vector)

// cmp - function to compare a and b. cmp(a, b) returns

// -/0/+ as a is less than/equal to/greater than b

template

void MergeSort(vector& data, int first, int last, int (*cmp)(const T& a, const T& b)) {

// Implement merge sort

// May write separate Merge function, or include Merge code in MergeSort

}