 |
 |
Walt Brainerd (Fortran Company: www.fortran.com/walt.html )has my "Fortran Array and Pointer Techniques" for sale at a very low price. It discusses timing(in general) for most of the common sorting methods. = Loren> Date: Wed, 8 Feb 2012 10:14:32 -0500 > From: [log in to unmask] > Subject: Sorting large array > To: [log in to unmask] > > Hello, > Does someone have a (public) code (preferably Fortran, but C is also OK > given C Interoperability) that can sort a large (1 billion elements) > array (say, reals) in place? The array is not huge, i.e., it fits in > memory, but still large. Quicksort, which I usually use, is recursive > and its memory usage quickly went out of control. Speed is not of utmost > importance though obviously O(N^2) won't do. > Thanks, > Aleks > > -- > Aleksandar Donev, Assistant Professor of Mathematics > Courant Institute of Mathematical Sciences > Office: 1016 Warren Weaver Hall, New York University > E-mail: [log in to unmask] > Phone: (212) 992-7315; Fax: (212) 995-4121 > Mailing address: 251 Mercer St, New York, NY 10012 > Web: http://cims.nyu.edu/~donev