revised 11/25/99, 12/03/99, 01/24/00

CHAPTER 47 --- Common Array Algorithms

An array with a single subscript is called a one dimensional array. The slots of the array can be thought of as lined up one after the other in a line. Two dimensional arrays, three dimensional arrays, and higher dimensional arrays also exist. This chapter will discuss typical ways in which one dimensional arrays are used.

Chapter Topics:

  • Arrays and counting loops.
  • The length of an array.
  • Finding the maximum and minimum of a numeric array.
  • Finding the sum of the elements of an array.
  • Computing the average of the elements of an array.
The slots of an array are often called elements. In a one dimensional array, the elements are accessed using a single index. In a two dimensional array, the elements are accessed using two indexes. Two dimensional arrays will be the subject of a later chapter.

QUESTION 1:

How (in general) could you print out every element of an array with 100 elements?

Click Here after you have answered the question