1 | // |
---|
2 | // ******************************************************************** |
---|
3 | // * License and Disclaimer * |
---|
4 | // * * |
---|
5 | // * The Geant4 software is copyright of the Copyright Holders of * |
---|
6 | // * the Geant4 Collaboration. It is provided under the terms and * |
---|
7 | // * conditions of the Geant4 Software License, included in the file * |
---|
8 | // * LICENSE and available at http://cern.ch/geant4/license . These * |
---|
9 | // * include a list of copyright holders. * |
---|
10 | // * * |
---|
11 | // * Neither the authors of this software system, nor their employing * |
---|
12 | // * institutes,nor the agencies providing financial support for this * |
---|
13 | // * work make any representation or warranty, express or implied, * |
---|
14 | // * regarding this software system or assume any liability for its * |
---|
15 | // * use. Please see the license in the file LICENSE and URL above * |
---|
16 | // * for the full disclaimer and the limitation of liability. * |
---|
17 | // * * |
---|
18 | // * This code implementation is the result of the scientific and * |
---|
19 | // * technical work of the GEANT4 collaboration. * |
---|
20 | // * By using, copying, modifying or distributing the software (or * |
---|
21 | // * any work based on the software) you agree to acknowledge its * |
---|
22 | // * use in resulting scientific publications, and indicate your * |
---|
23 | // * acceptance of all terms of the Geant4 Software license. * |
---|
24 | // ******************************************************************** |
---|
25 | // |
---|
26 | // |
---|
27 | // $Id: G4Sort.cc,v 1.5 2006/06/29 18:42:39 gunter Exp $ |
---|
28 | // GEANT4 tag $Name: HEAD $ |
---|
29 | // |
---|
30 | // ---------------------------------------------------------------------- |
---|
31 | // GEANT 4 source file |
---|
32 | // |
---|
33 | // G4Sort.cc |
---|
34 | // |
---|
35 | // ---------------------------------------------------------------------- |
---|
36 | |
---|
37 | #include "G4Sort.hh" |
---|
38 | |
---|
39 | |
---|
40 | void sort_double( G4double v[], G4int left, G4int right ) |
---|
41 | { |
---|
42 | // G4Sort elements in array from v[left] to v[right] |
---|
43 | // used recursively |
---|
44 | // algorithm comes from Kernighan and Ritchie, "The C Programming |
---|
45 | // Language", second edition, p.87 |
---|
46 | |
---|
47 | G4int i, last; |
---|
48 | if ( left >= right ) // do nothing if array contains |
---|
49 | return; // fewer than two elements |
---|
50 | |
---|
51 | swap_double( v, left, ( left + right ) / 2 ); // move part. elt. |
---|
52 | last = left; // to v[0] |
---|
53 | |
---|
54 | for ( i = left+1; i <= right; i++ ) // partition |
---|
55 | if ( v[i] < v[left] ) |
---|
56 | swap_double( v, ++last, i ); |
---|
57 | |
---|
58 | swap_double( v, left, last ); // restore partition element |
---|
59 | |
---|
60 | sort_double( v, left, last-1 ); |
---|
61 | sort_double( v, last+1, right ); |
---|
62 | return; |
---|
63 | } |
---|
64 | |
---|
65 | |
---|
66 | void swap_double( G4double v[], G4int i, G4int j ) |
---|
67 | { |
---|
68 | /* interchange elements i and j in an array */ |
---|
69 | G4double temp; |
---|
70 | temp = v[i]; |
---|
71 | v[i] = v[j]; |
---|
72 | v[j] = temp; |
---|
73 | } |
---|