diff options
| author | anastas <anastas@221aa14e-8319-0410-a670-987f0aec2ac5> | 2006-08-11 08:33:17 +0000 |
|---|---|---|
| committer | anastas <anastas@221aa14e-8319-0410-a670-987f0aec2ac5> | 2006-08-11 08:33:17 +0000 |
| commit | 954e2976e43507479e0bc5d1526e555627117125 (patch) | |
| tree | 64c01b8aa6c9bfee282df88a5a6f75452ae2ebf2 /gr-trellis/src/lib/quicksort_index.cc | |
| parent | ebd3845a6aac08b8b7058963e1d72c93d652f2f3 (diff) | |
Additional constructor for random interleaver (not working yet)
git-svn-id: http://gnuradio.org/svn/gnuradio/trunk@3233 221aa14e-8319-0410-a670-987f0aec2ac5
Diffstat (limited to 'gr-trellis/src/lib/quicksort_index.cc')
| -rw-r--r-- | gr-trellis/src/lib/quicksort_index.cc | 57 |
1 files changed, 57 insertions, 0 deletions
diff --git a/gr-trellis/src/lib/quicksort_index.cc b/gr-trellis/src/lib/quicksort_index.cc new file mode 100644 index 0000000000..705aeebed5 --- /dev/null +++ b/gr-trellis/src/lib/quicksort_index.cc @@ -0,0 +1,57 @@ +/* -*- c++ -*- */ +/* + * Copyright 2004 Free Software Foundation, Inc. + * + * This file is part of GNU Radio + * + * GNU Radio is free software; you can redistribute it and/or modify + * it under the terms of the GNU General Public License as published by + * the Free Software Foundation; either version 2, or (at your option) + * any later version. + * + * GNU Radio 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 General Public License for more details. + * + * You should have received a copy of the GNU General Public License + * along with GNU Radio; see the file COPYING. If not, write to + * the Free Software Foundation, Inc., 59 Temple Place - Suite 330, + * Boston, MA 02111-1307, USA. + */ + +#include "quicksort_index.h" + +template <class T> void SWAP (T & a, T & b) +{ +T temp=a; +a=b; +b=temp; +} + +template <class T> void quicksort_index(std::vector<T> & p, std::vector<int> & index, int left, int right) +{ +T pivot; + +if (left < right) { + int i = left; + int j = right + 1; + pivot = p[left]; + do { + do + i++; + while ((p[i] < pivot) && (i < right)); + do + j--; + while ((p[j] > pivot) && (j > left)); + if (i < j) { + SWAP <T> (p[i],p[j]); + SWAP <int> (index[i],index[j]); + } + } while (i < j); + SWAP <T> (p[left], p[j]); + SWAP <int> (index[left], index[j]); + quicksort_index(p,index, left, j-1); + quicksort_index(p,index, j+1, right); +} +} |