Program Listing for File MergeSort.h

↰ Return to documentation for file (ADS/sort/MergeSort.h)

/*--------------------------------------------------------------------------*/
/*---------------------------- File MergeSort.h ----------------------------*/
/*--------------------------------------------------------------------------*/
/*--------------------------------------------------------------------------*/
/*----------------------------- DEFINITIONS --------------------------------*/
/*--------------------------------------------------------------------------*/

#ifndef __ADS_MergeSort
 #define __ADS_MergeSort
                      /* self-identification: #endif constant */

/*--------------------------------------------------------------------------*/
/*------------------------------ INCLUDES ----------------------------------*/
/*--------------------------------------------------------------------------*/

#include "ADS/Contract.h"
#include "ADS/sequence/List.h"
#include "ADS/sort/InsertionSort.h"
#include "ADS/sort/Sorted.h"

#include <algorithm>
#include <cstddef>
#include <functional>
#include <utility>
#include <vector>

/*--------------------------------------------------------------------------*/
/*--------------------------- NAMESPACE ------------------------------------*/
/*--------------------------------------------------------------------------*/

namespace ADS {

template< class T , class C = std::less<> >
void mergeParts( std::vector< T > & A , std::vector< T > & B ,
                 std::size_t start , std::size_t mid , std::size_t end ,
                 C less = C() , long long * inv = nullptr );

template< class T , class C = std::less<> >
void mergeSortRec( std::vector< T > & A , std::vector< T > & B ,
                   std::size_t start , std::size_t end , std::size_t cutoff ,
                   C less = C() , long long * inv = nullptr );

template< class T , class C = std::less<> >
void mergeSort( std::vector< T > & A , std::size_t cutoff = 1 ,
                C less = C() );

template< class T , class C = std::less<> >
void mergeSortBottomUp( std::vector< T > & A , C less = C() );

template< class T , class C = std::less<> >
long long countInversions( std::vector< T > & A , C less = C() );

template< class T , class C = std::less<> >
void mergeSort( List< T > & L , C less = C() );

/*--------------------------------------------------------------------------*/

}  // end( namespace ADS )

/*--------------------------------------------------------------------------*/
/*-------------------------- IMPLEMENTATION --------------------------------*/
/*--------------------------------------------------------------------------*/

#include "ADS/sort/impl/MergeSort.tpp"

/*--------------------------------------------------------------------------*/

#endif  /* MergeSort.h included */

/*--------------------------------------------------------------------------*/
/*-------------------------- End File MergeSort.h --------------------------*/
/*--------------------------------------------------------------------------*/