-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmergeSort.cpp
82 lines (66 loc) · 2.5 KB
/
mergeSort.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
#include <iostream>
#include <type_traits>
using namespace std;
template <int... N>
struct Vector;
// divide
template <typename T1,typename T2 = Vector<>>
struct divide{};
template <int first,int... p1,int... p2>
struct divide<Vector<first,p1...>,Vector<p2...>>{
using type = typename conditional<(sizeof...(p1) + 1 > sizeof...(p2)),
divide<Vector<p1...>,Vector<p2...,first>>::type,
std::pair<Vector<first,p1...>,Vector<p2...>>
>::type;
};
template <int... p2>
struct divide<Vector<>,Vector<p2...>>{
using type = std::pair<Vector<>,Vector<p2...>>;
};
// merge
template <typename V1,typename V2, typename V3>
struct mergeVector{};
template <int V1First, int... V1Remains,int V2First,int... V2Remains,int... result>
struct mergeVector<Vector<V1First,V1Remains...>,Vector<V2First,V2Remains...>,Vector<result...>>{
using type = typename conditional<V1First <= V2First,
mergeVector<Vector<V1Remains...>,Vector<V2First,V2Remains...>,Vector<result..., V1First>>::type,
mergeVector<Vector<V1First,V1Remains...>,Vector<V2Remains...>,Vector<result..., V2First>>::type
>::type;
};
template <int... V2Remains,int... result>
struct mergeVector<Vector<>,Vector<V2Remains...>,Vector<result...>>{
using type = Vector<result...,V2Remains...>;
};
template <int... V1Remains,int... result>
struct mergeVector<Vector<V1Remains...>,Vector<>,Vector<result...>>{
using type = Vector<result...,V1Remains...>;
};
// sort
template <typename T>
struct sort{};
template <int ...Nums>
struct sort<Vector<Nums...>>{
using tmp = divide<Vector<Nums...>,Vector<>>::type;
using res = mergeVector<sort< tmp::first_type>::res,sort< tmp::second_type>::res,Vector<>>::type;
};
template <int N>
struct sort<Vector<N>>{
using res = Vector<N>;
};
template <>
struct sort<Vector<>>{
using res = Vector<>;
};
int main(){
static_assert(is_same_v<mergeVector<Vector<>,Vector<4,5,6,7>,Vector<>>::type,
Vector<4,5,6,7>
>);
static_assert(is_same_v<mergeVector<Vector<4,5,6,7>,Vector<1,2,3>,Vector<>>::type,
Vector<1,2,3,4,5,6,7>
>);
static_assert(is_same_v<divide<Vector<1,2>,Vector<>>::type,
pair<Vector<2>,Vector<1>>>);
static_assert(is_same_v<sort<Vector<12,3,2,1,10,18>>::res,Vector<1,2,3,10,12,18>>);
static_assert(is_same_v<sort<Vector<12>>::res,Vector<12>>);
return 0;
}