Skip to main content
SpringerLink
Log in

Algorithms

2. The while-construct

  • Series Article
  • Published:
Resonance Aims and scope Submit manuscript

Abstract

In this article, we consolidate the introductory concepts developed in the previous article of the series (Resonance, Vol.1, No.1) and develop theiterative construct, one of the most important control constructs used to describe algorithms.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Suggested Reading

  • D E Knuth. Art of Computer Programming. Volume 1, Addison-Wesley Publishing Co. 1972.

  • E W Dijkstra. A Short Introduction to the Art of Programming. Computer Society of India. 1977.

  • G Polya. How to Solve It. Princeton University Press. 1973.

  • R G Dromey. How to Solve it by Computer. Prentice-Hall of India, New Delhi. 1990.

Download references

Author information

Authors and Affiliations

  1. Computer Science Group, Tata Institute of Fundamental Research, Homi Bhabha Road, 400 005, Bombay, India

    R. K. Shyamasundar (Professor of Computer Science at TIFR)

Authors
  1. R. K. Shyamasundar
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shyamasundar, R.K. Algorithms. Reson 1, 13–23 (1996). https://doi.org/10.1007/BF02835618

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02835618

Keywords

Search

Navigation