Hi all,
I am looking for efficient, and possibly well written (i.e. Fortran
90/95) and structured sorting rouitines (quicksort, mergesort, etc.), as
well as routines for generating random numbers from uniform, gaussian
and bimodal (binary) distributions.
I have found some by searching the net, like Alan Miller's wonderful
site
http://www.ozemail.com.au/~milleraj/#Random number generation
that has both types of routines, or some old F77 routines on
fortran.com/fortran.
But speed is my primary concern, so I am not sure if these are the best
choice.
The important thing to say is that the array that will be already
partially sorted, so that algorithms that work faster on partially
ordered arrays are strongly preferred!
Any advice will be appreciated,
Aleksandar
--
_____________________________________________
Aleksandar Donev
Physics Department
Michigan State University
East Lansing, MI 48824-1116
E-mail: [log in to unmask]
Work phone: (517) 432-6770
_____________________________________________
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|