forked from cdmh/sorting_algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
/
introsort.h
40 lines (34 loc) · 1.73 KB
/
introsort.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
// Copyright (c) 2013 Craig Henderson
// https://github.com/cdmh/sorting_algorithms
#include "sort.h"
#include "introsort.detail.h"
#include <cmath> // floor, log
namespace cdmh {
// Introsort
// Worst case performance O(n log n)
// Average case performance O(n log n)
// http://en.wikipedia.org/wiki/Introsort
template<typename It, typename Pred=std::less<typename std::iterator_traits<It>::value_type>>
inline void introsort(It begin, It end, Pred pred=Pred())
{
if (std::distance(begin, end) > 1)
detail::introsort(begin, end, pred, (size_t)floor(log(std::distance(begin,end)/log(2.0))));
}
} // 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.