Digital data sorter external to a computer
AssigneeThe Singer Company
InventorsRobert J. Membrino, George D. Gilbreath, Jr.
Life of this patent
Estimating the term…
Abstract
This invention is an electronic sorting system that saves computer software and computer time by sorting random data that is stored in selectable locations within a digital computer. The electronic sorting system removes the random data from the digital computer and sorts this data in ascending order by repeatedly comparing the data. The sorted data is then loaded into the computer in other selectable locations within the digital computer.
Claims7
An electronic sorting system that saves computer software and computer time by sorting random data words that are being stored in selectable locations within a digital computer, said system comprising:
- a. an interface that causes the instruction words and data words of a digital computer to be electrically compatible with the remainder of said system so that the instruction and data words may be transferred from said computer;
- b. a first counter an input of which is coupled to said interface so that said first counter may receive instruction words from said interface which indicate the start location of the random data that is being stored within a digital computer;
- c. a second counter an input of which is coupled to said interface so that said second counter may receive instruction words from said interface which indicate the first location within the digital computer in which the sorted data is going to be stored;
- d. a third counter an input of which is coupled to said interface so that said third counter may receive instruction words from said interface which indicate the number of data words that said system has sorted and loaded into the computer;
- e. a fourth counter an input of which is coupled to said interface so that said fourth counter may receive instruction words from said interface which indicate the number of random data words that said sorting system has looked at in order to find the next word in the stored list;
- f. cyclic timing means coupled to said first counter, said second counter, said third counter and said fourth counter for maintaining said system in synchronization;
- g. a first means for storing data words, the output of said first means is coupled to the input of said interface and the input of said first means is coupled to the output of said interface and the output of said timing means;
- h. a second means for storing data words, the input of said second means is coupled to the output of said interface, the output of said timing means and the output of said first means;
- i. a first means for comparing data words, said first comparing means having two inputs that receive data words the first input being coupled to the output of said interface and the second input being coupled to the output of said first storing means so that said first comparing means may compare the data words appearing at its two inputs and determine the data word that has the greatest value;
- j. a second means for comparing data words, said second comparing means having two inputs that receive data words, the first input being coupled to the output of said interface and the second input being coupled to the output of said second storing means so that said second comparing means may compare the data words appearing at its two inputs and determine the data word that has the greatest value;
- and,
- k. means for determining that said first comparing means and said second comparing means have determined the data words that have the highest value, the inputs of said determining means are coupled to the output of said first comparing means, said second comparing means and said timing means and the output of said determining means is coupled to the input of said first storing means, whereby at the beginning of the sort said first storing means is set to its highest value and said second sorting means is set to zero whereupon each data word in the unsorted list is compared by said first and second comparing means in order to find data words that have a greater value than what is stored in said second storing means and a lesser value than what is stored in said first storing means, thence respectively stored in said first storing means until all the data words in the sorted list are compared, thence the data word currently stored in said first storing means is loaded into the computer, and said first storing means is set to its maximum value and said second storing means is set to the last value entered into the sorted list so that at the end of the sort a sequence of data words will be found and listed in the computer in ascending order.
Dependencies are inferred from the claim text.