String sorting technique for microcomputers

This paper reports the development of a sorting algorithm, called a ‘pocket sort.’ It is primarily directed to sorting of character data. The algorithm is strictly of order O(n); sorting time is directly proportional to the number of data elements to be sorted. Further, through the use of pointer -...

Full description

Saved in:
Bibliographic Details
Published inComputers & industrial engineering Vol. 11; no. 1; pp. 46 - 50
Main Author Brooks, George H.
Format Journal Article
LanguageEnglish
Published New York Elsevier Ltd 1986
Pergamon Press Inc
Subjects
Algorithms
Arrays
Computer programming
dispersion sorting
linked lists
ordering
PASCAL
Personal computers
pointers
Sorting
sorting algorithm
string sorting, character sorting
dispersion sorting
linked lists
ordering
string sorting, character sorting
sorting algorithm
pointers
Sorting
Online AccessGet full text

Cover

More Information
Summary:This paper reports the development of a sorting algorithm, called a ‘pocket sort.’ It is primarily directed to sorting of character data. The algorithm is strictly of order O(n); sorting time is directly proportional to the number of data elements to be sorted. Further, through the use of pointer - linked list data structures, no internal movement of the records containing the sort field is required. The algorithm has been implemented in Turbo Pascal. Data are presented comparing this pocket sort to other sorting techniques.
ISSN:0360-8352
1879-0550
DOI:10.1016/0360-8352(86)90047-1