00001 /* 00002 COSTA: Problem solving environment for data assimilation 00003 Copyright (C) 2007 Nils van Velzen 00004 00005 This library is free software; you can redistribute it and/or 00006 modify it under the terms of the GNU Lesser General Public 00007 License as published by the Free Software Foundation; either 00008 version 2.1 of the License, or (at your option) any later version. 00009 00010 This library is distributed in the hope that it will be useful, 00011 but WITHOUT ANY WARRANTY; without even the implied warranty of 00012 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 00013 Lesser General Public License for more details. 00014 00015 You should have received a copy of the GNU Lesser General Public 00016 License along with this library; if not, write to the Free Software 00017 Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA 00018 */ 00019 00020 /** 00021 \file cta_util_sort.h 00022 \brief Interface to the sorting utility functions of COSTA. 00023 This header file handles the C/FORTRAN interfacing 00024 */ 00025 00026 #ifndef CTA_UTILSORT_H 00027 #define CTA_UTILSORT_H 00028 #include "cta_system.h" 00029 00030 #ifdef __cplusplus 00031 extern "C" { 00032 #endif 00033 00034 /** \brief Sort an integer array using the Quicksort algorithm. 00035 * An additional interger array is permutated in way as the unsorted array 00036 * 00037 * 00038 * \param list (input/output) array, dimension (N) 00039 * On entry, the array to be sorted. 00040 * On exit, list has been sorted into increasing order 00041 * 00042 * \param indx (input/output) array, dimension (N) 00043 00044 * \param n (input) INTEGER 00045 * The length of the array D. 00046 * 00047 */ 00048 CTAEXPORT void CTA_Util_IQSort2(int *list, int *indx, int n); 00049 00050 #ifdef __cplusplus 00051 } 00052 #endif 00053 #endif