Skip to main content
  • 50 Accesses

Abstract

A problem of sufficient complexity to require the use of a computer for its solution is not likely to be solved by a succession of simple calculations. Indeed, if the computer is to behave as anything other than a fast calculating machine, it must, at various points in a solution, be directed to take some step other than that immediately following.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 74.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.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1978 I. R. Wilson and A. M. Addyman

About this chapter

Cite this chapter

Wilson, I.R., Addyman, A.M. (1978). Basic Control Constructs. In: A Practical Introduction to Pascal. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-1677-1_3

Download citation

  • DOI: https://doi.org/10.1007/978-1-4757-1677-1_3

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4757-1679-5

  • Online ISBN: 978-1-4757-1677-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics