Internal sort

Abstract: Sorting plays an increasingly important role in determining the overall performance of data base systems. Described is a new sorting scheme, called the rebound sort, implementable on a variety of technologies, e.g., magnetic bubbles and charge-coupled devices. The sort engine based on this new sorting scheme accepts as input a sequence of records, sorts them, and outputs the sorted records automatically. The actual sorting time is completely overlapped with the input/output time.

Abstract: Sorting algorithm is one of the most basic research fields in computer science. It's goal is to make record easier to search, insert and delete. Through the description of five sort algorithms: bubble, select, insert, merger and quick, the time and space complexity was summarized. Furthermore, two categories of O(n2) and O(nlog n) could be found out. From the aspects of input sequence scale and input sequence random degree, some results were obtained based on the experiments. When the size of records is small, insertion sort or selection sort performs well. When the sequence is ordered, insertion sort or bubble sort performs well. When the size of records is large, quick sort or merge sort performs well. Different application could select appropriate sort algorithm according to these rules.

Abstract: A system and architecture is disclosed for an electronic data processing system wherein the usage of a central processing unit in the system may be reduced and much of its work efficiently handled by a cooperating Sort Processor. The Sort Processor is an internally programmed black box unit that can be connected to the memory bus of almost any computer. It performs background sorting functions in real time or on-line installations, or operates as a stand-alone low priority processor in a uni-processor or multiprocessor installation. A Control Program initiates the action of the sort processor so that it operates autonomously and performs the functions of the ''''sort routine'''' in both internal sort and merge phases resulting in the saving of considerable Central Processing Unit time, main memory space, and simplification and reduction of programming efforts. The Sort Processor consists of search memory for storing the initial parameters of the sort operation, and a control memory for micro-program storage.