Copying List Structures without Auxiliary Storage

Abstract

An algorithm is presented for copying an arbitrary list structure into a block of contiguous storage locations without destroying the original list. Apart from a fixed number of program variables, no auxiliary storage, such as a stack, is used. The algorithm needs no mark bits and operates in linear time. It is shown to be significantly faster than the best previous algorithm for the same problem.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Oct 01, 1975
Accession Number
ADA025173

Entities

People

  • Douglas W. Clark

Organizations

  • Carnegie Mellon University

Tags

Communities of Interest

  • C4I

DTIC Thesaurus Topics

  • Air Force
  • Algorithms
  • Cell Structure
  • Cells
  • Computations
  • Computer Science
  • Computers
  • Instructions
  • Mathematics
  • Observation
  • Scientific Research
  • Trees (Data Structures)

Readers

  • Computer Programming and Software Development.
  • Systems Analysis and Design