Technical note: Efficient sorting routines in FORTRAN 77

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 FO...

Full description

Bibliographic Details
Main Authors: Houlsby, G, Sloan, S
Format: Journal article
Language:English
Published: 1984
_version_ 1797104119566041088
author Houlsby, G
Sloan, S
author_facet Houlsby, G
Sloan, S
author_sort Houlsby, G
collection OXFORD
description 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 whilst 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. All of the implementations are believed to be efficient, and should prove useful in engineering applications. Some timing statistics are given to illustrate the utility of the subroutines presented. © 1984.
first_indexed 2024-03-07T06:29:20Z
format Journal article
id oxford-uuid:f56de066-dc38-4ce9-8500-adab89018d53
institution University of Oxford
language English
last_indexed 2024-03-07T06:29:20Z
publishDate 1984
record_format dspace
spelling oxford-uuid:f56de066-dc38-4ce9-8500-adab89018d532022-03-27T12:27:14ZTechnical note: Efficient sorting routines in FORTRAN 77Journal articlehttp://purl.org/coar/resource_type/c_dcae04bcuuid:f56de066-dc38-4ce9-8500-adab89018d53EnglishSymplectic Elements at Oxford1984Houlsby, GSloan, SA 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 whilst 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. All of the implementations are believed to be efficient, and should prove useful in engineering applications. Some timing statistics are given to illustrate the utility of the subroutines presented. © 1984.
spellingShingle Houlsby, G
Sloan, S
Technical note: Efficient sorting routines in FORTRAN 77
title Technical note: Efficient sorting routines in FORTRAN 77
title_full Technical note: Efficient sorting routines in FORTRAN 77
title_fullStr Technical note: Efficient sorting routines in FORTRAN 77
title_full_unstemmed Technical note: Efficient sorting routines in FORTRAN 77
title_short Technical note: Efficient sorting routines in FORTRAN 77
title_sort technical note efficient sorting routines in fortran 77
work_keys_str_mv AT houlsbyg technicalnoteefficientsortingroutinesinfortran77
AT sloans technicalnoteefficientsortingroutinesinfortran77