00001 // 00002 // ******************************************************************** 00003 // * License and Disclaimer * 00004 // * * 00005 // * The Geant4 software is copyright of the Copyright Holders of * 00006 // * the Geant4 Collaboration. It is provided under the terms and * 00007 // * conditions of the Geant4 Software License, included in the file * 00008 // * LICENSE and available at http://cern.ch/geant4/license . These * 00009 // * include a list of copyright holders. * 00010 // * * 00011 // * Neither the authors of this software system, nor their employing * 00012 // * institutes,nor the agencies providing financial support for this * 00013 // * work make any representation or warranty, express or implied, * 00014 // * regarding this software system or assume any liability for its * 00015 // * use. Please see the license in the file LICENSE and URL above * 00016 // * for the full disclaimer and the limitation of liability. * 00017 // * * 00018 // * This code implementation is the result of the scientific and * 00019 // * technical work of the GEANT4 collaboration. * 00020 // * By using, copying, modifying or distributing the software (or * 00021 // * any work based on the software) you agree to acknowledge its * 00022 // * use in resulting scientific publications, and indicate your * 00023 // * acceptance of all terms of the Geant4 Software license. * 00024 // ******************************************************************** 00025 // 00026 // 00027 // $Id$ 00028 // 00029 // ---------------------------------------------------------------------- 00030 // GEANT 4 source file 00031 // 00032 // G4Sort.cc 00033 // 00034 // ---------------------------------------------------------------------- 00035 00036 #include "G4Sort.hh" 00037 00038 00039 void sort_double( G4double v[], G4int left, G4int right ) 00040 { 00041 // G4Sort elements in array from v[left] to v[right] 00042 // used recursively 00043 // algorithm comes from Kernighan and Ritchie, "The C Programming 00044 // Language", second edition, p.87 00045 00046 G4int i, last; 00047 if ( left >= right ) // do nothing if array contains 00048 return; // fewer than two elements 00049 00050 swap_double( v, left, ( left + right ) / 2 ); // move part. elt. 00051 last = left; // to v[0] 00052 00053 for ( i = left+1; i <= right; i++ ) // partition 00054 if ( v[i] < v[left] ) 00055 swap_double( v, ++last, i ); 00056 00057 swap_double( v, left, last ); // restore partition element 00058 00059 sort_double( v, left, last-1 ); 00060 sort_double( v, last+1, right ); 00061 return; 00062 } 00063 00064 00065 void swap_double( G4double v[], G4int i, G4int j ) 00066 { 00067 /* interchange elements i and j in an array */ 00068 G4double temp; 00069 temp = v[i]; 00070 v[i] = v[j]; 00071 v[j] = temp; 00072 }