'SORT BY EXCHANGE' ON LINKED LISTS,

Abstract

The sort-by-exchange method for a linked list consists of comparing consecutive links between items and then making a physical exchange if a link is out of place. After the last 2 links on the list have been compared, the process begins again at the head of the list, terminating only when no further exchanges are needed. This procedure applies for ordering relatively short lists (short enough to be contained in directly accessible memory) on which a few links are out of sequence.

Document Details

Document Type
Technical Report
Publication Date
Apr 01, 1965
Accession Number
AD0614783

Entities

People

  • Donald Cohen
  • Gerald Levitt

Organizations

  • RAND Corporation

Tags

DTIC Thesaurus Topics

  • Lists (Data Structures)
  • Sequences

Readers

  • Business Analytics
  • Gulf War Illness and Chronic Multisymptom Illness in Veterans.
  • Regression Analysis.