Need help with merge sort function !

[ACHRAF92]

hi,
I tried to make a generic implementation in C ++, but I don't know how to create the "merge" function.
someone to show me the program of the "Merge" function please
thank you in advance :)

  //Merge sort implementation
  //-------------------------
#include "/home/src/prog.hpp"
template<typename T>
void mergesort(vector<T> &t) {
    if(t.size() > 1) {
      vector<T> t1(t.begin(), t.begin()+t.size()/2);
      vector<T> t2(t.begin()+t.size()/2, t.end());
      merge sort(t1); merge sort(t2);
      merge(t1, t2, t);
    }
}

[dhayden]

I think you need mergesort() to call a second function that does the work:

// Merge sort the sorted subvectors [i1,i2) and [i2,i3)
mergesort(vector<T>::iterator i1, vector<T>::iterator i2, vector<T>::iterator i3);