I will soon try Steve's MEM Sort...
Any limitations (except for available memory)?
Suppose I had variable length strings which I can easily (?) convert to fixed length strings using CHR$(0) padding at the end of the string - so say each string is 1024 (1k) bytes long.
In a 32 Gbyte RAM computer, suppose that I can arrange that 10 Gbyte is available.
Can I have 10 Gbyte \ (1 Kbytes) = 10 M strings that can be sorted - even more strings if of shorter length?