Import Geant4 0.0.0 source tree

2016-06-01 15:25:35 +02:00
parent 54d6b71f95
commit b97f8d0df7
3237 changed files with 807095 additions and 0 deletions
@@ -0,0 +1,59 @@
+// This code implementation is the intellectual property of
+// the RD44 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 2.1 1998/10/20 16:33:59 broglia Exp $
+// GEANT4 tag $Name: geant4-00 $
+//
+//  File: G4Sort.cc
+//  Author:  Alan Breakstone
+//
+//  Description
+//
+//	Routines to G4Sort arrays of various kinds of numbers
+//
+
+#include "G4Sort.hh"
+
+
+void G4Sort_double( G4double v[], int left, int 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  
+  
+  int 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
+  
+  G4Sort_double( v, left, last-1 );
+  G4Sort_double( v, last+1, right );
+  return;
+}
+
+
+void swap_double( G4double v[], int i, int j )
+{
+  /*  interchange elements i and j in an array  */
+  G4double temp;
+  temp = v[i];
+  v[i] = v[j];
+  v[j] = temp;
+}
+
+
+
+