Skip to main content

Part of the book series: Macmillan Computer Science Series ((COMPSS))

  • 28 Accesses

Abstract

Every serious program must repeat some of its operations many times over. For example, a program that handles a file of employees and produces a set of payslips will apply the same set of rules to each employee record in turn.

So Round about And round about And round about and round about And round about And round about I go’ A. A. Milne, Now We Are Six

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Copyright information

© 1978 Andrew J. T. Colin

About this chapter

Cite this chapter

Colin, A.J.T. (1978). Loops and Program Efficiency. In: Programming and Problem-Solving in Algol 68. Macmillan Computer Science Series. Palgrave, London. https://doi.org/10.1007/978-1-349-03561-8_5

Download citation

  • DOI: https://doi.org/10.1007/978-1-349-03561-8_5

  • Publisher Name: Palgrave, London

  • Print ISBN: 978-0-333-23115-9

  • Online ISBN: 978-1-349-03561-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics