DocumentCode :
962464
Title :
Electronic Data Sorting
Author :
Demuth, Howard B.
Author_Institution :
Department of Electrical Engineering, University of Tulsa, Tulsa, OK 74104.
Issue :
4
fYear :
1985
fDate :
4/1/1985 12:00:00 AM
Firstpage :
296
Lastpage :
310
Abstract :
This paper presents results of a study of the fundamentals of sorting. Emphasis is placed on understanding sorting and on minimizing the time required to sort with electronic equipment of reasonable cost. Sorting is viewed as a combination of information gathering and item moving activities. Shannon´s communication theory measure of information is applied to assess the difficulty of various sorting problems. Bounds on the number of comparisons required to sort are developed, and optimal or near-optimal sorting schemes are described and investigated. Three abstract sorting models based on cyclic, linear, and randomaccess memories are defined. Optimal or near-optimal sorting methods are developed for the models and their parallel-register extensions. A brief review of the origin of the work and some of its hypotheses is also presented.
Keywords :
Bibliographies; Computational complexity; Cost function; Information analysis; Information theory; Remotely operated vehicles; Sorting; Telephony; Time series analysis; Vocabulary; Bounds; communication theory; comparisons; complexity; computational complexity; information gathering; information theory; item moving; model; optimal; parallel; sorting;
fLanguage :
English
Journal_Title :
Computers, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9340
Type :
jour
DOI :
10.1109/TC.1985.5009380
Filename :
5009380
Link To Document :
بازگشت