Method for sorting data in a computer at high speed by using data word values for address locations

摘要: The invention comprises a method of completely sorting an unsorted data table in single pass through the data. uses relatively large amount computer memory, but sorts at great speed. Specifically, each word is scaled to size equal or less than number address locations sort table. value created for converted increment which added initial then stored into above calculated that related word. In this way, most words are placed sorted arrangement without comparison iteration. also resolving conflicts where already contains case both with respect other create subclass and auxiliary storage subsequent conflicts, conflicting moved en masse yet further location storage. A element gathering merging has been as described above. mode eliminates null values between places subclasses resolved sequence