An efficient algorithm that enables you to sort multiple ASCII files, with a sequence tree that might expand to depth 10, by default
The sorted sequence tree may expand to further depth levels, this routine uses default depth 10. It exhibits fast sorting of a text file up to the size of 1M or 50K lines/rows.
The s switch is the line characters index ie the line sorting starting position, usually set to 0 but if first n line characters are uniform, setting -s n+1 will skip them sorting all lines from the next position.
In a hurry? Add it to your Download Basket!
What's New in version 1.3.1
- Speed improved