I'm looking for a way to implement merge sort to sort the pairs[] array in the tideman problem. The problem being the array is made up of the strut pair, not ints. However, I have added an element to the strut, a pair.score, to record the strength of victory for that pair. Now I seem stuck, as I can't figure out how to use the score in the merge sort function I got working.
void sort_pairs(void) // I'd like to use pairs.score as the int so I can keep it associated w the pair!!!
{
merge_sort(???, pair_count) // I have this working with an array of ints <---;
