The address sort and other computer sorting techniques

Originally this project was to have been a feasibility study of the use of computers in the library. It soon became clear that the logical place in the library at which to start making use of the computer was the catalogue. Once the catalogue was in machine-readable form it would be possible to work backwards to the book ordering and acquisitions system and forwards to the circulation and book issue system. One of the big advantages in using the computer to produce the catalogue would be the elimination of the "skilled drudgery" of filing. Thus vast quantities of data would need to be sorted. And thus the scope of this project was narrowed down from a general feasibility study, firstly to a study of a particular section of the library and secondly to one particularly important aspect of that section - that of sorting with the aid of the computer. I have examined many, but by no means all computer sorting techniques, programmed them in FORTRAN as efficiently as I was able, and compared their performances on the IBM 1130 computer of the University of Cape Town. I have confined myself to internal sorts, i.e. sorts that take place in core. This thesis stops short of applying the best of these techniques to the library. I intend however to do so, and to work back to the original scope of my thesis.

Grantor dc:publisher.institution

Department of Statistical Sciences

Year dc:date.issued

1971

Author dc:creator

• Underhill, Leslie G

Advisor dc:contributor.advisor

• Troskie, Casper G

Language dc:language.iso

eng

Handle dc:identifier.uri

http://hdl.handle.net/11427/18068

OAI identifier oai:identifier

oai:open.uct.ac.za:11427/18068