EFFICIENT SORTING ROUTINES IN FORTRAN 77.

被引：4

作者：

Houlsby, G.T. ^{[1
]}

Sloan, S.W. ^{[1
]}

机构：

[1] Univ of Oxford, Dep of Engineering, Science, Oxford, Engl, Univ of Oxford, Dep of Engineering Science, Oxford, Engl

来源：

Advances in Engineering Software | 1984年 / 6卷 / 04期

关键词：

COMPUTER PROGRAMMING - Algorithms - COMPUTER PROGRAMS;

D O I：

10.1016/0141-1195(84)90004-4

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

A problem faced which arises in many computing applications is that of sorting the entries in a list into ascending sequence of their values. Efficient algorithms for sorting long lists usually require recursive techniques and are not straightforward to program in a non-recursive language such as FORTRAN 77. This paper describes three FORTRAN 77 implementations of the insertion sort, quicksort and modified quicksort algorithms. The first algorithm is suitable for short lists while the second two are suitable for longer lists. A detailed description of the removal of recursion from the quicksort algorithm by the use of stacks is presented. Some timing statistics are given to illustrate the utility of the subroutines presented.

引用

页码：198 / 203