PRIME and PDQ Sorts - Efficient Minimal Storage Sorting Algorithms.

Abstract

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)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 1979
Accession Number
ADA073567

Entities

People

  • Roy R. Hilbrand

Tags

Communities of Interest

  • Air Platforms
  • Biomedical
  • Cyber
  • Ground and Sea Platforms
  • Space
  • Weapons Technologies

DTIC Thesaurus Topics

  • Air Force
  • Aircraft Engines
  • Aircraft Equipment
  • Aircrafts
  • Algorithms
  • Computations
  • Computer Programming
  • Computer Programs
  • Computer Science
  • Computers
  • Corporations
  • Engineering
  • Military Research
  • Physics Laboratories
  • Technical Information Centers
  • Test And Evaluation
  • Universities

Fields of Study

  • Computer science

Readers

  • Child and Adolescent Substance Abuse Science in Autism Spectrum Disorders.
  • Computational Modeling and Simulation
  • Graph Algorithms and Convex Optimization.