Original Publication Date: 1985-Jun-01
Included in the Prior Art Database: 2005-Feb-18
This article describes an algorithm to sort records received in a random order into Data Language/I (DL/I) hierarchical order (inverted tree structure). It sorts records representing network hardware components, ordered by date of last record access, into the order in which macros representing these components must appear in the generation of a network control program. Each record contains a record identifier and the record identifier of the record which is its immediate DL/I "parent". Records may also contain other information. Other requirements are: 1. The DL/I structure may have any number of levels. 2. Each DL/I parent may have any number of "children". 3. All records must be sorted by one pass.