(Solved) : Need Help Main Function Using Code Sorttxt 16180924548286887403809363855823195142271616656 Q35813888 . . . .

I just need help with the main function using my code.

Sort.txt

16180924548286887403809363855823195142271616656247817160925896345887437118520600162217180213258755337427722476715976592637625155946386754226138672586846121542614177891683190451221169778159096830705750511625518647211931432968788918337153777321264767758540542173895564864235371073135814287902391426596011727526514255823577251054855764630862835448717813161176006135161027285675438474698592402678226699716143163841690559332153807744594647201180367158749659651407125509736359388473596442510836044345354674513304549368770965007500319372641937409183416396873877052785424862016102438816786611275276173436606853944520311288479874977289278335664988119216672781456956436971494705145958544842570840819447448208659077552703344462060984864773232973203106135428388672518826932574521608388670138813890875853417096460084017504654468495918045402764611487374209633643459539465674520893633082246817012405343

implementation of merge and mergesort already done here.

// adopted from Weiss, Data Structures and Alg Analysis withC++

#ifndef MERGESORT_H
#define MERGESORT_H

#include <vector>
using namespace std;

template <typename C>
void mergeSort( vector<C>& v );
template <typename C>
void mergeSort( vector<C>& v, vector<C>& tmp,int left, int right);
template <typename C>
void merge(vector<C>& v, vector<C>& tmp, intleftPos, int rightPos, int righEnd);

/**
* Mergesort algorithm (driver).
*/
template <typename C>
void mergeSort( vector<C>& v )
{
vector<C> tmp( v.size( ) );

mergeSort( v, tmp, 0,