2 * This file is part of the GROMACS molecular simulation package.
4 * Copyright (c) 1991-2001
5 * BIOSON Research Institute, Dept. of Biophysical Chemistry
6 * University of Groningen, The Netherlands
7 * Copyright (c) 2012,2013, by the GROMACS development team, led by
8 * David van der Spoel, Berk Hess, Erik Lindahl, and including many
9 * others, as listed in the AUTHORS file in the top-level source
10 * directory and at http://www.gromacs.org.
12 * GROMACS is free software; you can redistribute it and/or
13 * modify it under the terms of the GNU Lesser General Public License
14 * as published by the Free Software Foundation; either version 2.1
15 * of the License, or (at your option) any later version.
17 * GROMACS is distributed in the hope that it will be useful,
18 * but WITHOUT ANY WARRANTY; without even the implied warranty of
19 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
20 * Lesser General Public License for more details.
22 * You should have received a copy of the GNU Lesser General Public
23 * License along with GROMACS; if not, see
24 * http://www.gnu.org/licenses, or write to the Free Software Foundation,
25 * Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
27 * If you want to redistribute modifications to GROMACS, please
28 * consider that scientific software is very special. Version
29 * control is crucial - bugs must be traceable. We will be happy to
30 * consider code for inclusion in the official distribution, but
31 * derived work must not be called official GROMACS. Details are found
32 * in the README & COPYING files - if they are missing, get the
33 * official version at http://www.gromacs.org.
35 * To help us fund GROMACS development, we humbly ask that you cite
36 * the research papers on the package. Check out http://www.gromacs.org.
43 #include "types/simple.h"
44 #include "gmx_fatal.h"
46 /*Make range-array (Permutation identity) for sorting */
47 void rangeArray(int *ar,int size)
55 void pswap(int *v1, int *v2)
64 void Swap (real *v1, real *v2)
74 void insertionSort(real *arr, int *perm, int startndx, int endndx, int direction) {
78 for (i = startndx; i <=endndx; i++) {
81 while (j > startndx && arr[j - 1] > arr[j]) {
82 Swap(&arr[j],&arr[j-1]);
83 pswap(&perm[j],&perm[j-1]);
92 for (i = startndx; i <=endndx; i++) {
95 while (j > startndx && arr[j - 1] < arr[j]) {
96 Swap(&arr[j],&arr[j-1]);
97 pswap(&perm[j],&perm[j-1]);
106 int BinarySearch (real *array, int low, int high, real key,int direction)
112 /*Iterative implementation*/
117 if(key<array[mid-1]) max=mid;
123 else if (direction<0){
126 if(key>array[mid-1]) max=mid;
131 }/*end -ifelse direction*/
136 int start_binsearch(real *array, int *perm, int low, int high,
137 real key, int direction)
139 insertionSort(array,perm,low,high,direction);
140 return BinarySearch(array,low,high,key,direction);
143 int LinearSearch (double *array,int startindx, int stopindx,
144 double key,int *count, int direction)
146 /*Iterative implementation - assume elements sorted*/
152 for (i=startindx;i<=stopindx;i++){
160 else if(direction<0 ){
162 for(i=stopindx;i>=startindx;i--){
172 gmx_fatal(FARGS,"Startindex=stopindex=%d\n",startindx);