/usr/include/linbox/algorithms/bitonic-sort.h is in liblinbox-dev 1.3.2-1.1build2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 | /* Copyright (C) LinBox
* Written by Zhendong Wan
*
*
*
* ========LICENCE========
* This file is part of the library LinBox.
*
* LinBox is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
* ========LICENCE========
*/
#ifndef __LINBOX_bitonic_sort_H
#define __LINBOX_bitonic_sort_H
/*! @file algorithms/bitonic-sort.h
* Implement bitonic sorting network
*/
#include <algorithm>
namespace LinBox
{
/* end - begin must be a power of 2*/
template <class Iterator, class Comparator>
void bitonicSort(Iterator begin, Iterator end, const Comparator& comparator = Comparator());
/* end - begin must be a power of 2*/
template <class Iterator, class Comparator>
void bitonicMerge(Iterator begin, Iterator end, const Comparator& comparator = Comparator());
///
template<class Iterator, class Comparator>
void bitonicSort(Iterator begin, Iterator end, const Comparator& comparator)
{
if (end - begin >= 2) {
Iterator mid = begin + (end - begin) / 2;
// Sort the first half
bitonicSort(begin, mid, comparator);
// Sort the second half
bitonicSort(mid, end, comparator);
// reverse the order of second half
std::reverse(mid, end);
// Bitonic merge two halves
bitonicMerge(begin, end, comparator);
}
}
template<class Iterator, class Comparator>
void bitonicMerge(Iterator begin, Iterator end, const Comparator& comparator)
{
if (end - begin >= 2) {
Iterator mid = begin + (end - begin) / 2;
Iterator p1 = begin;
Iterator p2 = mid;
// Compare network
for (p1 = begin, p2 = mid; p2 != end; ++ p1, ++ p2)
comparator(*p1, *p2);
// Bitonic Merge first half
bitonicMerge(begin, mid, comparator);
// Bitonic Merge second half
bitonicMerge(mid, end, comparator);
}
}
}
#endif //__LINBOX_bitonic_sort_H
// vim:sts=8:sw=8:ts=8:noet:sr:cino=>s,f0,{0,g0,(0,:0,t0,+0,=s
// Local Variables:
// mode: C++
// tab-width: 8
// indent-tabs-mode: nil
// c-basic-offset: 8
// End:
|