forked from cdmh/sorting_algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
/
quicksort.detail.h
62 lines (53 loc) · 2.26 KB
/
quicksort.detail.h
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
// Copyright (c) 2013 Craig Henderson
// https://github.com/cdmh/sorting_algorithms
#pragma once
namespace cdmh {
namespace detail {
template<typename T>
inline T median(T const &t1, T const &t2, T const &t3)
{
if (t1 < t2)
{
if (t2 < t3)
return t2;
else if (t1 < t3)
return t3;
else
return t1;
}
else if (t1 < t3)
return t1;
else if (t2 < t3)
return t3;
else
return t2;
}
template<typename It, typename Pred>
inline std::pair<It,It> quicksort_splits(It begin, It end, Pred pred)
{
using value_t = typename std::iterator_traits<It>::value_type;
using namespace std::placeholders;
auto const not_pred = [&pred](value_t const &first, value_t const &second) { return !pred(second, first); };
auto const pivot = detail::median(*begin, *detail::advance(begin, std::distance(begin, end) / 2), *detail::advance(end, -1));
auto const split = std::partition(begin, end, std::bind(pred, _1, pivot));
return std::make_pair(split, std::partition(split, end, std::bind(not_pred, _1, pivot)));
}
} // namespace detail
} // namespace cdmh
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Software without restriction, including without limitation the rights
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
// copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included in
// all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
// THE SOFTWARE.