Abstract
In the examples used so far each data item that we wished to manipulate has been given a name, or identifier. Each identifier has associated with it a type, and a storage class. This association is made explicit through the declaration. But so far any identifier has represented a numeric value of one type or another, or a character. Consider again example 4.3 in which we produced a grade for a given mark. If we now change the specification of the problem, to ask that we produce the number of times that each grade was achieved, the statements in example 7.1 could appear in a suitable loop.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
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). Arrays. In: A Book on C. Macmillan Computer Science Series. Palgrave, London. https://doi.org/10.1007/978-1-349-12804-4_8
Download citation
DOI: https://doi.org/10.1007/978-1-349-12804-4_8
Publisher Name: Palgrave, London
Print ISBN: 978-0-333-56919-1
Online ISBN: 978-1-349-12804-4
eBook Packages: EngineeringEngineering (R0)