Skip to main content

Loops

  • Chapter
A Book on C

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

  • 653 Accesses

Abstract

The conditional statements of the previous chapter freed our programs from the straitjacket of the sequential execution of instructions without branching, but it is the ability to loop, or repeat the execution of one or more instructions, that brings power to programming. It brings economy too, for a modest number of programming language statements can be responsible for a significant amount of computing time.

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

Access this chapter

eBook
USD 19.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Authors

Copyright information

© 1988 R. E. Berry, B. A. E. Meekings and M. D. Soren

About this chapter

Cite this chapter

Berry, R.E., Meekings, B.A.E., Soren, M.D. (1988). Loops. In: A Book on C. Macmillan Computer Science Series. Palgrave Macmillan, London. https://doi.org/10.1007/978-1-349-10233-4_6

Download citation

  • DOI: https://doi.org/10.1007/978-1-349-10233-4_6

  • Publisher Name: Palgrave Macmillan, London

  • Print ISBN: 978-0-333-46529-5

  • Online ISBN: 978-1-349-10233-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics