The Shell-Metzner sort algorithm is a very fast sorting routine which surpasses other more well-known routines. The BASIC program written here allows for sorting data from a disk or diskette or from DATA statements.
Get full access to this article
View all access options for this article.
References
1.
Boillot, M. (1984). Understanding FORTRAN77 with structured problem solving. St. Paul, MN: West Publishing Company.
2.
Grillo, J. (c. 1980). A comparison of sorts. Creative Computing, 2.
3.
Montgomery, J. (1980). Shell-Metzner sort. Personal Computing, 4, 6-9.
4.
Shell, D. L. (1959). A high-speed sorting procedure. Communications of the Association for Computing Machinery, 2 (No. 7), 30-32.
5.
Walker, D. (1980). Beyond Shell-Metzner. Microcomputing, 9, 192-194.
