Loops

  • Chapter
A Book on C

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

  • 88 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Authors

Copyright information

© 1993 B. A. E. Meekings, T. P. Kudrycki and M. D. Soren

About this chapter

Cite this chapter

Meekings, B.A.E., Kudrycki, T.P., Soren, M.D. (1993). Loops. In: A Book on C. Macmillan Computer Science Series. Palgrave, London. https://doi.org/10.1007/978-1-349-12804-4_6

Download citation

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

  • Publisher Name: Palgrave, London

  • Print ISBN: 978-0-333-56919-1

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

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Navigation