3 * Copyright 2004 Free Software Foundation, Inc.
5 * This file is part of GNU Radio
7 * GNU Radio is free software; you can redistribute it and/or modify
8 * it under the terms of the GNU General Public License as published by
9 * the Free Software Foundation; either version 2, or (at your option)
12 * GNU Radio is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 * GNU General Public License for more details.
17 * You should have received a copy of the GNU General Public License
18 * along with GNU Radio; see the file COPYING. If not, write to
19 * the Free Software Foundation, Inc., 51 Franklin Street,
20 * Boston, MA 02110-1301, USA.
23 #include "quicksort_index.h"
25 template <class T> void SWAP (T & a, T & b)
33 // standard quicksorting but also return the indices of the sorted data
34 // don't know how to make it work with swig...
35 template <class T> void quicksort_index(std::vector<T> & p, std::vector<int> & index, int left, int right)
45 while ((p[i] < pivot) && (i < right));
48 while ((p[j] > pivot) && (j > left));
51 SWAP <int> (index[i],index[j]);
54 SWAP <T> (p[left], p[j]);
55 SWAP <int> (index[left], index[j]);
56 quicksort_index <T> (p,index, left, j-1);
57 quicksort_index <T> (p,index, j+1, right);
63 // Same as above (only works for int data)
64 void quicksort_index1(std::vector<int> & p, std::vector<int> & index, int left, int right)
74 while ((p[i] < pivot) && (i < right));
77 while ((p[j] > pivot) && (j > left));
79 SWAP <int> (p[i],p[j]);
80 SWAP <int> (index[i],index[j]);
83 SWAP <int> (p[left], p[j]);
84 SWAP <int> (index[left], index[j]);
85 quicksort_index1 (p,index, left, j-1);
86 quicksort_index1 (p,index, j+1, right);