Boots – shoes – and leggings
Patent
1990-06-28
1994-11-29
Kulik, Paul V.
Boots, shoes, and leggings
364DIG1, 36422281, 3642229, G06F 15411, G06F 736
Patent
active
053697626
ABSTRACT:
The invention comprises a method of completely sorting an unsorted data table in a single pass through the data. The method uses a relatively large amount of computer memory, but sorts the data at great speed. Specifically, each unsorted data word is scaled to a size equal to or less than the number of address locations in a sort table. The scaled value created for each unsorted data word is converted to an address increment which is added to the initial address of the sort table. The unsorted data word is then stored into the sort table at the above calculated address that is related to the value of the data word. In this way, most words are placed in a sorted arrangement without comparison or iteration. The invention also comprises a method for resolving conflicts where a calculated address for an unsorted data word already contains a sorted data word. In this case both words are then sorted with respect to each other to create a data subclass and stored in an auxiliary storage table. In the case of subsequent conflicts, conflicting data is sorted and then moved en masse to yet a further location in auxiliary storage. A further element is a method of gathering and merging the data which has been sorted as described above. The gathering mode eliminates the null values between sorted data words and places the subclasses of resolved conflicts in sequence in the data table.
REFERENCES:
patent: 3505653 (1970-04-01), Kautz
patent: 3568155 (1971-03-01), Abraham et al.
patent: 3662402 (1972-05-01), Bond et al.
patent: 3713107 (1973-01-01), Barsamian
patent: 3815083 (1974-06-01), Dirks et al.
patent: 4031520 (1977-06-01), Rohner
patent: 4209845 (1980-06-01), Berger
patent: 4210961 (1980-07-01), Whitlow et al.
patent: 4417321 (1983-11-01), Chang et al.
patent: 4425617 (1984-01-01), Sherwood
patent: 4510567 (1985-04-01), Chang et al.
patent: 4570221 (1986-02-01), Martens
patent: 4575798 (1986-03-01), Lindstron et al.
patent: 4595995 (1986-07-01), Alles
patent: 4611280 (1986-09-01), Linderman
patent: 4628483 (1986-12-01), Nelsen
patent: 4809158 (1989-02-01), McCauley
patent: 5030077 (1991-06-01), Florence et al.
patent: 5117495 (1992-05-01), Liu
patent: 5121493 (1992-06-01), Ferguson
patent: 5146590 (1992-09-01), Lorie et al.
Tremblay, Jean-Paul, et al., "An Introduction to Data Structures with Applications", 1984 by McGraw-Hill, Inc., pp. 611-622.
Ralston, Anthony, et al., "Encyclopedia of Computer Science", 1st ed., 1976, pp. 604-606; 1393-1400.
Sedgewick, Robert, "Algorithms," 1983 by Addison-Wesley Pub. Co. Inc., pp. 201-210.
Lorin, Harold, "Sorting and Sort Systems", 1975 by Addison-Wesley Pub. Co., Inc., pp. 177-179.
Knuth, Donald E., "The Art of Computer Programming", vol. 3/Sorting and Searching, pp. 506-543.
Tremblay, Jean-Paul et al., "An Introduction to Data Structures with Applications," 1984 by McGraw-Hill, Inc., pp. 560-569.
Lorin, Harold, "Sorting and Sort Systems," 1975 by Addison-Wesley Publishing Co., Inc., pp. 162-166.
Kulik Paul V.
Morris Jules Jay
Powsner David J.
LandOfFree
Method for sorting data in a computer at high speed by using dat does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method for sorting data in a computer at high speed by using dat, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method for sorting data in a computer at high speed by using dat will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-80732