// Created by mohammad aghazadeh #include using namespace std; using Test_Type = double; // change type here template void marge (T *a, const int low, const int high, const int mid ) { int n2 = high - mid; int n1 = mid - low + 1; T *L = new T [ n1 + 1 ]; T *R = new T [ n2 + 1 ]; for ( int i = 0; i < n1; ++i ) { L[ i ] = a[ low + i ]; } for ( int j = 0; j < n2; ++j ) { R[ j ] = a[ mid + j + 1 ]; } L[ n1 ] = 999999999.; R[ n2 ] = 999999999.; int i = 0; int j = 0; for ( int k = low; k <= high; ++k ) { if ( L[ i ] < R[ j ] ) { a[ k ] = L[ i ]; ++i; } else { a[ k ] = R[ j ]; ++j; } } delete [] L; delete [] R; } template void marge_sort ( T *a, const int low, const int high ) { if ( low < high ) { int mid = ( low + high ) / 2; // cout << p << endl << q << endl<< r; marge_sort< T > ( a, low, mid ); marge_sort< T > ( a, mid + 1, high ); marge< T > ( a, low, high, mid ); } } int main () { int n; cout << "enter the quantity :) " << endl; cin >> n; Test_Type *a = new Test_Type [ n ]; for ( int i = 0; i < n; ++i ) { cout << "enter" << i + 1 << " th num:) " << " "; cin >> a[ i ]; } cout << "before:" << endl; for ( int i = 0; i < n; ++i ) { cout << a[ i ] << " "; } marge_sort< Test_Type > ( a, 0, n - 1 ); cout << "after:" << endl; for ( int i = 0; i < n; ++i ) { cout << a[ i ] << " "; } delete [] a; return 0; }

[Q&A] Templated Merge Sort