proff@phoenix.pub.uu.oz.au (F. Solidus [Proff]) (04/16/91)
Well actually just a subroutine would do. Basiclly I need sorting routine that will sort data that is far larger in length than available heap space. The files to be sorted will be for sorting purposes the same as a variable-line-length text file. If you have anything like the above hanging around, throw it at me, and i'll try to adapt it. - Proff The Mad Proffessor/The Force |Tiger! Tiger! burning bright "The Tiger" by W. Blake, stanza one - |In the forests of the night, SMART:proff@phoenix.pub.uu.oz.au |What immortal hand or eye, DUMB:...uunet!phoenix.pub.uu.oz.au!proff |Could frame thy fearful symmetry? -- The Mad Proffessor/The Force |Tiger! Tiger! burning bright "The Tiger" by W. Blake, stanza one - |In the forests of the night, SMART:proff@phoenix.pub.uu.oz.au |What immortal hand or eye, DUMB:...uunet!phoenix.pub.uu.oz.au!proff |Could frame thy fearful symmetry?
wcs) (04/19/91)
In article <1991Apr16.034046.15252@phoenix.pub.uu.oz.au> proff@phoenix.pub.uu.oz.au (F. Solidus [Proff]) writes:
] Well actually just a subroutine would do. Basiclly I need sorting
]routine that will sort data that is far larger in length than available heap
]space. The files to be sorted will be for sorting purposes the same as a
]variable-line-length text file.
Will the UNIX "sort" program do? It may be kind of outdated for
modern virtual-memory systems, but it was made to solve just
your problem and run on PDP-11s. If you must run MS-DOS,
get the MKS Toolkit, and use their sort.
]|Tiger! Tiger! burning bright
Didn't Blake spell it "Tyger"?
--
Pray for peace; Bill
# Bill Stewart 908-949-0705 erebus.att.com!wcs AT&T Bell Labs 4M-312 Holmdel NJ
# Actually, it's *two* drummers, and we're not marching, we're *dancing*.
# But that's the general idea.