Efficient radix sorting system employing a dynamic branch table

摘要: In a recursive distributive sort of records according to their key fields, method for distributing keys form one or more subgroups and collecting them preserve maintain an order among the subgroups. The distribution is accomplished by comparing each field against extrinsic attribute then assigning subgroup bucket. collection sequence preserves overall order. A Dynamic Branching Table (DBT) governing ordering buckets during phase initially populated with NO-OP instructions. During phase, CALL instruction replaces in sorted DBT position upon first occurrence distinguishable character being scanned. An address pointer, pointing corresponding bucket, inserted Bucket Pointer (BPT) indexed DBT. executed empty are skipped execution, while processed subroutine execution.