A set of efficient list operations

R.R. Hoogerwoord

Research output: Contribution to journalArticleAcademicpeer-review

9 Citations (Scopus)


In this paper we show that it is possible to implement a symmetric set of finite-list operations efficiently; the set is symmetric in the sense that lists can be manipulated at either end. We derive the definitions of these operations from their specifications by calculation. The operations have O(1) time complexity, provided that we content ourselves with, so-called, amortized efficiency, instead of worst-case efficiency.
Original languageEnglish
Pages (from-to)505-513
JournalJournal of Functional Programming
Issue number4
Publication statusPublished - 1992


Dive into the research topics of 'A set of efficient list operations'. Together they form a unique fingerprint.

Cite this