PRIME and PDQ Sorts -Efficient Minimal Storage Sorting Algorithms.

摘要

One of the problems involved in computer programs for vulnerability assessment is that of rapidly sorting and arranging large sets of data. Two sorting algorithms, designated PRIME and PDQ, have been developed at ASD to more efficiently perform this function in vulnerability programs such as SESTEM and FASTEGEN II. The results are compared to those obtained with three other algorithms, SHELLSORT, TREESORT3, and SINGLETON. The newly developed sorts are showed to be significantly faster on the ASD CDC 6600 computer than the existing sorts. When used in an ASD missile endgame model SESTEM, the average run time was reduced by 20 to 25%. Program listings, flow charts, and typical output data are presented. (Author)