msort Downloads

msort is a fast sorting/indexing example that builds a file position sorting tree as a result of n-depth text file line byte sorting.

The sorted sequence tree may expand to further depth levels, this routine uses default depth 10. It exibits 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.