Title

String Sorting Technique For Microcomputers

Comments

Authors: contact us about adding a copy of your work at STARS@ucf.edu

Abbreviated Journal Title

Comput. Ind. Eng.

Keywords

Computer Science; Interdisciplinary Applications; Engineering; Industrial

Abstract

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.

Journal Title

Computers & Industrial Engineering

Volume

11

Issue/Number

1-4

Publication Date

1-1-1986

Document Type

Article

Language

English

First Page

46

Last Page

50

WOS Identifier

WOS:A1986D101100011

ISSN

0360-8352

Share

COinS