Accession Number:

ADA025173

Title:

Copying List Structures without Auxiliary Storage

Descriptive Note:

Interim rept.

Corporate Author:

CARNEGIE-MELLON UNIV PITTSBURGH PA DEPT OF COMPUTER SCIENCE

Personal Author(s):

Report Date:

1975-10-01

Pagination or Media Count:

32.0

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.

Subject Categories:

  • Theoretical Mathematics
  • Computer Hardware

Distribution Statement:

APPROVED FOR PUBLIC RELEASE