Gabriele Cosmo
71 lines
2.6 KiB
C++
71 lines
2.6 KiB
C++
//
|
|
// ********************************************************************
|
|
// * DISCLAIMER *
|
|
// * *
|
|
// * The following disclaimer summarizes all the specific disclaimers *
|
|
// * of contributors to this software. The specific disclaimers,which *
|
|
// * govern, are listed with their locations in: *
|
|
// * http://cern.ch/geant4/license *
|
|
// * *
|
|
// * Neither the authors of this software system, nor their employing *
|
|
// * institutes,nor the agencies providing financial support for this *
|
|
// * work make any representation or warranty, express or implied, *
|
|
// * regarding this software system or assume any liability for its *
|
|
// * use. *
|
|
// * *
|
|
// * This code implementation is the intellectual property of the *
|
|
// * GEANT4 collaboration. *
|
|
// * By copying, distributing or modifying the Program (or any work *
|
|
// * based on the Program) you indicate your acceptance of this *
|
|
// * statement, and all its terms. *
|
|
// ********************************************************************
|
|
//
|
|
//
|
|
// $Id: G4Sort.cc,v 1.4 2001/07/11 09:59:46 gunter Exp $
|
|
// GEANT4 tag $Name: geant4-05-00 $
|
|
//
|
|
// ----------------------------------------------------------------------
|
|
// GEANT 4 source file
|
|
//
|
|
// G4Sort.cc
|
|
//
|
|
// ----------------------------------------------------------------------
|
|
|
|
#include "G4Sort.hh"
|
|
|
|
|
|
void sort_double( G4double v[], G4int left, G4int right )
|
|
{
|
|
// G4Sort elements in array from v[left] to v[right]
|
|
// used recursively
|
|
// algorithm comes from Kernighan and Ritchie, "The C Programming
|
|
// Language", second edition, p.87
|
|
|
|
G4int i, last;
|
|
if ( left >= right ) // do nothing if array contains
|
|
return; // fewer than two elements
|
|
|
|
swap_double( v, left, ( left + right ) / 2 ); // move part. elt.
|
|
last = left; // to v[0]
|
|
|
|
for ( i = left+1; i <= right; i++ ) // partition
|
|
if ( v[i] < v[left] )
|
|
swap_double( v, ++last, i );
|
|
|
|
swap_double( v, left, last ); // restore partition element
|
|
|
|
sort_double( v, left, last-1 );
|
|
sort_double( v, last+1, right );
|
|
return;
|
|
}
|
|
|
|
|
|
void swap_double( G4double v[], G4int i, G4int j )
|
|
{
|
|
/* interchange elements i and j in an array */
|
|
G4double temp;
|
|
temp = v[i];
|
|
v[i] = v[j];
|
|
v[j] = temp;
|
|
}
|