TEXTSORT Many programs have been published for sorting TEXTfiles. All the ones I have seen have the sorting routines written in BASIC, and are unfortuneately rather slow. TEXTSORT is based on Stefano Tendon's super lexfile SORTX1B. It is crude, but it works. Essentially it determines the maximum width of the TEXTfile, and using FILESZR from either TEXTUTIL or EDLEX it determines the number of lines in the TEXTfile. The program then creates an appropriately sized DATAfile, PRINTs the TEXTfile into the DATAfile, destroys the TEXTfile, sorts the DATAfile using LEXSORT from SORTX1B, creates a new TEXTfile with the same name as the original, prints the DATAfile into it and destroys the DATAfile. Using it is easy - just RUN TEXTSORT and respond to the prompt. When the program stops you will have a sorted version in RAM. Speed - well a recent test on a 331 line TEXTfile took 88 seconds, with most of the 88 seconds being taken up in printing the TEXTfile to the DATAfile and printing the datafile to the texfile. If you have a quicker means of TEXTfile sorting, I'd like to know. Mark Cracknell, 6 Stratton Mews, Off South Street, Leighton Buzzard, Bedfordshire LU7 8NT, England.