This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
K.A. Schember, University of Texas
A large number of sorting and searching techniques, covering a variety of applications, are dealt with in computer science literature. The classical problem associated with these methods has been determining which set of algorithms is most appropriate for a given application. With the recent advances in LSI technology and the assured proliferation of microprocessors and RAM memory, yet another application has evolved. Memory address widths associated with microprocessor systems are limited, in many cases, to a maximum of 16 bits, severely restricting maximum memory size. Minimal storage implementation techniques, characterized by the optimal use of the data space associated with an algorithm, therefore, are most appropriate for these restricted address space environments common to microprocessor systems.
Citation:
K.A. Schember, J.R. Rumsey, "Microsystems Minimal Storage Sorting and Searching Techniques for RAM Applications: a Tutorial," Computer, vol. 10, no. 6, pp. 92-100, June 1977, doi:10.1109/C-M.1977.217752
Usage of this product signifies your acceptance of the Terms of Use.