🚀 go-pugleaf

/ hpfcso:comp.sources.d / ericw@hpfcso.FC.HP.COM (Eric Widhalm) / 11:14 am  Sep  1, 1992 /
/ hpfcso:comp.sources.d / frank@D012S436.sniap.mchp.sni.de () /  3:35 am  Aug 27, 1992 /
I'm writing a program which needs to sort a large array 
parts of which are swapped in and out of memory (my own
implementation of a sort of VM).

The array is divided up into pages of size ~8K which are
swapped to disk as necessary on a LRU basis.  

Does anyone know of a sorting algorithm which will work in 
harmony with this LRU paging?  I can quicksort the elements 
of each individual page of the array, but then the problem 
is to sort the pages themselves with the minimum amount 
of swapping.  Traditional sort alrgorithms optimise on
comparisons - what I want is also to optimise the *order*
of comparison, I think.  Any ideas?


Any help appreciated,
Frank O'Dwyer
--
Frank O'Dwyer		       			Disclaimer: 
Siemens-Nixdorf AG 	                        I will deny everything
Tel.  : +49 (89) 636-40639                      Fax.  : +49 (89) 636-45860
e-mail: Frank.ODwyer@sniap.mchp.sni.de
----------
----------