Outline

Intro to Programming

Chapter 4:
Arrays

 2003 Prentice Hall, Inc.

All rights reserved.
 2

Introduction

• Arrays
– Structures of related data items
– Static entity (same size throughout program)

 2003 Prentice Hall, Inc. All rights reserved.

 3

Arrays

• Array
– Consecutive group of memory locations
– Same name and type (int, char, etc.)
• To refer to an element
– Specify array name and position number (index)
– Format: arrayname[ position number ]
– First element at position 0
• N-element array c
c[ 0 ], c[ 1 ] … c[ n - 1 ]
– Nth element as position N-1

 2003 Prentice Hall, Inc. All rights reserved.

 4

Arrays

• Array elements like other variables

– Assignment, printing for an integer array c
c[ 0 ] = 3;
cout << c[ 0 ];
• Can perform operations inside subscript
c[ 5 – 2 ] same as c[3]

 2003 Prentice Hall, Inc. All rights reserved.

 5

Arrays
Name of array (Note
that all elements of
this array have the
same name, c)

c[0] -45
c[1] 6
c[2] 0
c[3] 72
c[4] 1543
c[5] -89
c[6] 0
c[7] 62
c[8] -3
c[9] 1
c[10] 6453
c[11] 78

Position number of the

element within array c

 2003 Prentice Hall, Inc. All rights reserved.

 6

Declaring Arrays

• When declaring arrays, specify

– Name
– Type of array
• Any data type
– Number of elements
– type arrayName[ arraySize ];
int c[ 10 ]; // array of 10 integers
float d[ 3284 ]; // array of 3284 floats

• Declaring multiple arrays of same type

– Use comma separated list, like regular variables
int b[ 100 ], x[ 27 ];

 2003 Prentice Hall, Inc. All rights reserved.

 7

Examples Using Arrays

• Initializing arrays
– For loop
• Set each element
– Initializer list
• Specify each element when array declared
int n[ 5 ] = { 1, 2, 3, 4, 5 };
• If not enough initializers, rightmost elements 0
• If too many syntax error
– To set every element to 0
int n[ 5 ] = { 0 };
– If array size omitted, initializers determine size
int n[] = { 1, 2, 3, 4, 5 };
• 5 initializers, therefore 5 element array

 2003 Prentice Hall, Inc. All rights reserved.

 8
1 // Fig. 4.3: fig04_03.cpp
2 // Initializing an array.
Outline
3 #include <iostream>
4
fig04_03.cpp
5 using std::cout;
(1 of 2)
6 using std::endl;
7
8 #include <iomanip>
9
10 using std::setw;
11
Declare a 10-element array of
12 int main() integers.
13 {
14 int n[ 10 ]; // n is an array of Initialize
10 integersarray to 0 using a
15 for loop. Note that the array
16 // initialize elements of array n has
to 0elements n[0] to n[9].
17 for ( int i = 0; i < 10; i++ )
18 n[ i ] = 0; // set element at location i to 0
19
20 cout << "Element" << setw( 13 ) << "Value" << endl;
21
22 // output contents of array n in tabular format
23 for ( int j = 0; j < 10; j++ )
24 cout << setw( 7 ) << j << setw( 13 ) << n[ j ] << endl;
25

 2003 Prentice Hall, Inc.

All rights reserved.
 9
26 return 0; // indicates successful termination
27
Outline
28 } // end main

Element Value
fig04_03.cpp
0 0 (2 of 2)
1 0
2 0 fig04_03.cpp
3 0 output (1 of 1)
4 0
5 0
6 0
7 0
8 0
9 0

 2003 Prentice Hall, Inc.

All rights reserved.
 10
1 // Fig. 4.4: fig04_04.cpp
2 // Initializing an array with a declaration.
Outline
3 #include <iostream>
4
fig04_04.cpp
5 using std::cout;
(1 of 1)
6 using std::endl;
7
8 #include <iomanip>
9
10 using std::setw;
11
12 int main() Note the use of the initializer
13 { list.
14 // use initializer list to initialize array n
15 int n[ 10 ] = { 32, 27, 64, 18, 95, 14, 90, 70, 60, 37 };
16
17 cout << "Element" << setw( 13 ) << "Value" << endl;
18
19 // output contents of array n in tabular format
20 for ( int i = 0; i < 10; i++ )
21 cout << setw( 7 ) << i << setw( 13 ) << n[ i ] << endl;
22
23 return 0; // indicates successful termination
24
25 } // end main

 2003 Prentice Hall, Inc.

All rights reserved.
 11
Element Value
0 32
Outline
1 27
2 64
fig04_04.cpp
3 18
output (1 of 1)
4 95
5 14
6 90
7 70
8 60
9 37

 2003 Prentice Hall, Inc.

All rights reserved.
 12

Examples Using Arrays

• Array size
– Can be specified with constant variable (const)
• const int size = 20;
– Constants cannot be changed
– Constants must be initialized when declared
– Also called named constants or read-only variables

 2003 Prentice Hall, Inc. All rights reserved.

 13
1 // Fig. 4.5: fig04_05.cpp
2 // Initialize array s to the even integers from 2 to 20.
Outline
3 #include <iostream>
4
fig04_05.cpp
5 using std::cout;
(1 of 2)
6 using std::endl;
7
8 #include <iomanip>
9
10 using std::setw;
11 Note use of const keyword.
12 int main()
Only const variables can
13 {
specify array sizes.
14 // constant variable can be used to specify array size
15 const int arraySize = 10;
The program becomes more
16
17 int s[ arraySize ]; // array s
scalable when we set the array
has 10 elements
18 size using a const variable.
19 for ( int i = 0; i < arraySize; i++ ) // We
set can
the change
values arraySize,
20 s[ i ] = 2 + 2 * i; and all the loops will still
21 work (otherwise, we’d have to
22 cout << "Element" << setw( 13 ) << "Value"update every loop in the
<< endl;
23 program).

 2003 Prentice Hall, Inc.

All rights reserved.
 14
24 // output contents of array s in tabular format
25 for ( int j = 0; j < arraySize; j++ )
Outline
26 cout << setw( 7 ) << j << setw( 13 ) << s[ j ] << endl;
27
fig04_05.cpp
28 return 0; // indicates successful termination
(2 of 2)
29
30 } // end main
fig04_05.cpp
Element Value output (1 of 1)
0 2
1 4
2 6
3 8
4 10
5 12
6 14
7 16
8 18
9 20

 2003 Prentice Hall, Inc.

All rights reserved.
 15
1 // Fig. 4.6: fig04_06.cpp
2 // Using a properly initialized constant variable.
Outline
3 #include <iostream>
4
fig04_06.cpp
5 using std::cout;
(1 of 1)
6 using std::endl;
7 Proper initialization of
8 int main() const variable. fig04_06.cpp
9 { output (1 of 1)
10 const int x = 7; // initialized constant variable
11
12 cout << "The value of constant variable x is: "
13 << x << endl;
14
15 return 0; // indicates successful termination
16
17 } // end main

The value of constant variable x is: 7

 2003 Prentice Hall, Inc.

All rights reserved.
 16
1 // Fig. 4.7: fig04_07.cpp
2 // A const object must be initialized.
Outline
3 Uninitialized const results
4 int main() in a syntax error. Attempting
fig04_07.cpp
5 { to modify the const is
(1 of 1)
6 const int x; // Error: x another
must error.
be initialized
7
8 x = 7; // Error: cannot modify a const variable fig04_07.cpp
9 output (1 of 1)
10 return 0; // indicates successful termination
11
12 } // end main

d:\cpphtp4_examples\ch04\Fig04_07.cpp(6) : error C2734: 'x' :

const object must be initialized if not extern
d:\cpphtp4_examples\ch04\Fig04_07.cpp(8) : error C2166:
l-value specifies const object

 2003 Prentice Hall, Inc.

All rights reserved.
 17
1 // Fig. 4.8: fig04_08.cpp
2 // Compute the sum of the elements of the array.
Outline
3 #include <iostream>
4
fig04_08.cpp
5 using std::cout;
(1 of 1)
6 using std::endl;
7
8 int main() fig04_08.cpp
9 { output (1 of 1)
10 const int arraySize = 10;
11
12 int a[ arraySize ] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 };
13
14 int total = 0;
15
16 // sum contents of array a
17 for ( int i = 0; i < arraySize; i++ )
18 total += a[ i ];
19
20 cout << "Total of array element values is " << total << endl;
21
22 return 0; // indicates successful termination
23
24 } // end main

Total of array element values is 55

 2003 Prentice Hall, Inc.

All rights reserved.
 18
1 // Fig. 4.9: fig04_09.cpp
2 // Histogram printing program.
3 #include <iostream>
4
5 using std::cout;
6 using std::endl;
7
8 #include <iomanip>
9
10 using std::setw;
11
12 int main()
13 {
14 const int arraySize = 10;
15 int n[ arraySize ] = { 19, 3, 15, 7, 11, 9, 13, 5, 17, 1 };
16
17 cout << "Element" << setw( 13 ) << "Value"
18 << setw( 17 ) << "Histogram" << endl;
19
20 // for each element of array n, output a bar in histogram
21 for ( int i = 0; i < arraySize; i++ ) {
22 cout << setw( 7 ) << i << setw( 13 )
23 << n[ i ] << setw( 9 );
24
25 for ( int j = 0; j < n[ i ]; j++ ) // print one bar
26 cout << '*';

 2003 Prentice Hall, Inc. All rights reserved.

http://www.deitel.com
 19
27
28 cout << endl; // start next line of output
29
30 } // end outer for structure
31
32 return 0; // indicates successful termination
33
34 } // end main

Element Value Histogram

0 19 *******************
1 3 ***
2 15 ***************
3 7 *******
4 11 ***********
5 9 *********
6 13 *************
7 5 *****
8 17 *****************
9 1 *

 2003 Prentice Hall, Inc. All rights reserved.

http://www.deitel.com
 20

Examples Using Arrays

• Recall static storage (chapter 3)

– If static, local variables save values between function
calls
– Visible only in function body
– Can declare local arrays to be static
• Initialized to zero
static int array[3];
• If not static
– Created (and destroyed) in every function call

 2003 Prentice Hall, Inc. All rights reserved.

 21
1 // Fig. 4.13: fig04_13.cpp
2 // Static arrays are initialized to zero.
Outline
3 #include <iostream>
4
fig04_13.cpp
5 using std::cout;
(1 of 3)
6 using std::endl;
7
8 void staticArrayInit( void ); // function prototype
9 void automaticArrayInit( void ); // function prototype
10
11 int main()
12 {
13 cout << "First call to each function:\n";
14 staticArrayInit();
15 automaticArrayInit();
16
17 cout << "\n\nSecond call to each function:\n";
18 staticArrayInit();
19 automaticArrayInit();
20 cout << endl;
21
22 return 0; // indicates successful termination
23
24 } // end main
25

 2003 Prentice Hall, Inc.

All rights reserved.
 22
26 // function to demonstrate a static local array
27 void staticArrayInit( void )
Static array, initialized to zero Outline
28 { on first function call.
29 // initializes elements to 0 first time function is called
fig04_13.cpp
30 static int array1[ 3 ];
(2 of 3)
31
32 cout << "\nValues on entering staticArrayInit:\n";
33
34 // output contents of array1
35 for ( int i = 0; i < 3; i++ )
36 cout << "array1[" << i << "] = " << array1[ i ] << " ";
37
Array data is changed; the
38 cout << "\nValues on exiting staticArrayInit:\n";
modified values stay.
39
40 // modify and output contents of array1
41 for ( int j = 0; j < 3; j++ )
42 cout << "array1[" << j << "] = "
43 << ( array1[ j ] += 5 ) << " ";
44
45 } // end function staticArrayInit
46

 2003 Prentice Hall, Inc.

All rights reserved.
 23
47 // function to demonstrate an automatic local array
48 void automaticArrayInit( void ) Automatic array, recreated Outline
49 { with every function call.
50 // initializes elements each time function is called
fig04_13.cpp
51 int array2[ 3 ] = { 1, 2, 3 };
(3 of 3)
52
53 cout << "\n\nValues on entering automaticArrayInit:\n";
54
55 // output contents of array2
56 for ( int i = 0; i < 3; i++ )
57 cout << "array2[" << i << "] = " << array2[ i ] << " ";
58
Although the array is
59 cout << "\nValues on exiting automaticArrayInit:\n";
changed, it will be destroyed
60
61 // modify and output contents of array2
when the function exits and
62 for ( int j = 0; j < 3; j++ ) the changes will be lost.
63 cout << "array2[" << j << "] = "
64 << ( array2[ j ] += 5 ) << " ";
65
66 } // end function automaticArrayInit

 2003 Prentice Hall, Inc.

All rights reserved.
 24
First call to each function:
Outline
Values on entering staticArrayInit:
array1[0] = 0 array1[1] = 0 array1[2] = 0
fig04_13.cpp
Values on exiting staticArrayInit:
output (1 of 1)
array1[0] = 5 array1[1] = 5 array1[2] = 5

Values on entering automaticArrayInit:

array2[0] = 1 array2[1] = 2 array2[2] = 3
Values on exiting automaticArrayInit:
array2[0] = 6 array2[1] = 7 array2[2] = 8

Second call to each function:

Values on entering staticArrayInit:

array1[0] = 5 array1[1] = 5 array1[2] = 5
Values on exiting staticArrayInit:
array1[0] = 10 array1[1] = 10 array1[2] = 10

Values on entering automaticArrayInit:

array2[0] = 1 array2[1] = 2 array2[2] = 3
Values on exiting automaticArrayInit:
array2[0] = 6 array2[1] = 7 array2[2] = 8

 2003 Prentice Hall, Inc.

All rights reserved.
 25

Passing Arrays to Functions

• Specify name without brackets

– To pass array myArray to myFunction
int myArray[ 24 ];
myFunction( myArray, 24 );
– Array size usually passed, but not required
• Useful to iterate over all elements

 2003 Prentice Hall, Inc. All rights reserved.

 26

Passing Arrays to Functions

• Arrays passed-by-reference
– Functions can modify original array data
– Value of name of array is address of first element
• Function knows where the array is stored
• Can change original memory locations
• Individual array elements passed-by-value
– Like regular variables
– square( myArray[3] );

 2003 Prentice Hall, Inc. All rights reserved.

 27

Passing Arrays to Functions

• Functions taking arrays

– Function prototype
• void modifyArray( int b[], int arraySize );
• void modifyArray( int [], int );
– Names optional in prototype
• Both take an integer array and a single integer
– No need for array size between brackets
• Ignored by compiler
– If declare array parameter as const
• Cannot be modified (compiler error)
• void doNotModify( const int [] );

 2003 Prentice Hall, Inc. All rights reserved.

 28
1 // Fig. 4.14: fig04_14.cpp
2 // Passing arrays and individual array elements to functions.
Outline
3 #include <iostream>
4
fig04_14.cpp
5 using std::cout;
(1 of 3)
6 using std::endl;
7
8 #include <iomanip>
9
Syntax for accepting an array
10 using std::setw; in parameter list.
11
12 void modifyArray( int [], int ); // appears strange
13 void modifyElement( int );
14
15 int main()
16 {
17 const int arraySize = 5; // size of array a
18 int a[ arraySize ] = { 0, 1, 2, 3, 4 }; // initialize a
19
20 cout << "Effects of passing entire array by reference:"
21 << "\n\nThe values of the original array are:\n";
22
23 // output original array
24 for ( int i = 0; i < arraySize; i++ )
25 cout << setw( 3 ) << a[ i ];

 2003 Prentice Hall, Inc.

All rights reserved.
 29
26
27 cout << endl;
Pass array name (a) and size Outline
28 to function. Arrays are
29 // pass array a to modifyArray bypassed-by-reference.
reference
fig04_14.cpp
30 modifyArray( a, arraySize );
(2 of 3)
31
32 cout << "The values of the modified array are:\n";
33
34 // output modified array
35 for ( int j = 0; j < arraySize; j++ )
36 cout << setw( 3 ) << a[ j ];
37
38 // output value of a[ 3 ]
39 cout << "\n\n\n"
40 << "Effects of passing array element by value:"
Pass a single array element by
41 << "\n\nThe value of a[3] is " << a[ 3 ] << '\n';
42
value; the original cannot be
43 // pass array element a[ 3 ] by valuemodified.
44 modifyElement( a[ 3 ] );
45
46 // output value of a[ 3 ]
47 cout << "The value of a[3] is " << a[ 3 ] << endl;
48
49 return 0; // indicates successful termination
50
51 } // end main

 2003 Prentice Hall, Inc.

All rights reserved.
 30
52 Although named b, the array
53 // in function modifyArray, "b" points to
Outline
points to the original array a.
54 // the original array "a" in memory
It can modify a’s data.
55 void modifyArray( int b[], int sizeOfArray )
fig04_14.cpp
56 {
(3 of 3)
57 // multiply each array element by 2
58 for ( int k = 0; k < sizeOfArray; k++ )
59 b[ k ] *= 2;
60
61 } // end function modifyArray
62
Individual array elements are
63 // passed
in function modifyElement, "e" is a local copybyofvalue, and the
64 //array element a[ 3 ] passed from main originals cannot be changed.
65 void modifyElement( int e )
66 {
67 // multiply parameter by 2
68 cout << "Value in modifyElement is "
69 << ( e *= 2 ) << endl;
70
71 } // end function modifyElement

 2003 Prentice Hall, Inc.

All rights reserved.
 31
Effects of passing entire array by reference:
Outline
The values of the original array are:
0 1 2 3 4
fig04_14.cpp
The values of the modified array are:
output (1 of 1)
0 2 4 6 8

Effects of passing array element by value:

The value of a[3] is 6

Value in modifyElement is 12
The value of a[3] is 6

 2003 Prentice Hall, Inc.

All rights reserved.
 32
1 // Fig. 4.15: fig04_15.cpp
2 // Demonstrating the const type qualifier.
Outline
3 #include <iostream>
4
Array parameter declared as fig04_15.cpp
5 using std::cout;
const. Array cannot be (1 of 2)
6 using std::endl;
7
modified, even though it is
8 passed byprototype
void tryToModifyArray( const int [] ); // function reference.
9
10 int main()
11 {
12 int a[] = { 10, 20, 30 };
13
14 tryToModifyArray( a );
15
16 cout << a[ 0 ] << ' ' << a[ 1 ] << ' ' << a[ 2 ] << '\n';
17
18 return 0; // indicates successful termination
19
20 } // end main
21

 2003 Prentice Hall, Inc.

All rights reserved.
 33
22 // In function tryToModifyArray, "b" cannot be used
23 // to modify the original array "a" in main.
Outline
24 void tryToModifyArray( const int b[] )
25 {
fig04_15.cpp
26 b[ 0 ] /= 2; // error
(2 of 2)
27 b[ 1 ] /= 2; // error
28 b[ 2 ] /= 2; // error
29 fig04_15.cpp
30 } // end function tryToModifyArray output (1 of 1)

d:\cpphtp4_examples\ch04\Fig04_15.cpp(26) : error C2166:

l-value specifies const object
d:\cpphtp4_examples\ch04\Fig04_15.cpp(27) : error C2166:
l-value specifies const object
d:\cpphtp4_examples\ch04\Fig04_15.cpp(28) : error C2166:
l-value specifies const object

 2003 Prentice Hall, Inc.

All rights reserved.
 34

Sorting Arrays

• Sorting data
– Important computing application
– Virtually every organization must sort some data
• Massive amounts must be sorted
• Bubble sort (sinking sort)
– Several passes through the array
– Successive pairs of elements are compared
• If increasing order (or identical), no change
• If decreasing order, elements exchanged
– Repeat these steps for every element

 2003 Prentice Hall, Inc. All rights reserved.

 35

Sorting Arrays

• Example:
– Go left to right, and exchange elements as necessary
• One pass for each element
– Original: 3 4 2 7 6
– Pass 1: 3 2 4 6 7 (elements exchanged)
– Pass 2: 2 3 4 6 7
– Pass 3: 2 3 4 6 7 (no changes needed)
– Pass 4: 2 3 4 6 7
– Pass 5: 2 3 4 6 7
– Small elements "bubble" to the top (like 2 in this example)

 2003 Prentice Hall, Inc. All rights reserved.

 36

Sorting Arrays

• Swapping variables
int x = 3, y = 4;
y = x;
x = y;

• What happened?
– Both x and y are 3!
– Need a temporary variable
• Solution
int x = 3, y = 4, temp = 0;
temp = x; // temp gets 3
x = y; // x gets 4
y = temp; // y gets 3

 2003 Prentice Hall, Inc. All rights reserved.

 37
1 // Fig. 4.16: fig04_16.cpp
2 // This program sorts an array's values into ascending order.
Outline
3 #include <iostream>
4
fig04_16.cpp
5 using std::cout;
(1 of 3)
6 using std::endl;
7
8 #include <iomanip>
9
10 using std::setw;
11
12 int main()
13 {
14 const int arraySize = 10; // size of array a
15 int a[ arraySize ] = { 2, 6, 4, 8, 10, 12, 89, 68, 45, 37 };
16 int hold; // temporary location used to swap array elements
17
18 cout << "Data items in original order\n";
19
20 // output original array
21 for ( int i = 0; i < arraySize; i++ )
22 cout << setw( 4 ) << a[ i ];
23

 2003 Prentice Hall, Inc.

All rights reserved.
 38
24 // bubble sort Do a pass for each element in
25 // loop to control number of passes the array.
Outline
26 for ( int pass = 0; pass < arraySize - 1; pass++ )
27
fig04_16.cpp
28 // loop to control number of comparisons per pass
(2 of 3)
29 for ( int j = 0; j < arraySize - 1; j++ )
30
31 If the
// compare side-by-side elements and swap them if element on the left
32 // first element is greater than second element
(index j) is larger than the
33 if ( a[ j ] > a[ j + 1 ] ) {
element on the right (index j
34 hold = a[ j ];
+ 1), then we swap them.
35 a[ j ] = a[ j + 1 ];
36 a[ j + 1 ] = hold;
Remember the need of a temp
37 variable.
38 } // end if
39

 2003 Prentice Hall, Inc.

All rights reserved.
 39
40 cout << "\nData items in ascending order\n";
41
Outline
42 // output sorted array
43 for ( int k = 0; k < arraySize; k++ )
fig04_16.cpp
44 cout << setw( 4 ) << a[ k ];
(3 of 3)
45
46 cout << endl;
47 fig04_16.cpp
48 return 0; // indicates successful termination output (1 of 1)
49
50 } // end main

Data items in original order

2 6 4 8 10 12 89 68 45 37
Data items in ascending order
2 4 6 8 10 12 37 45 68 89

 2003 Prentice Hall, Inc.

All rights reserved.
 40
Case Study: Computing Mean and Median Using
Arrays
• Mean
– Average (sum/number of elements)
• Median
– Number in middle of sorted list
– 1, 2, 3, 4, 5 (3 is median)
– If even number of elements, take average of middle two

 2003 Prentice Hall, Inc. All rights reserved.

 41
1 // Fig. 4.17: fig04_17.cpp
2 // This program introduces the topic of survey data analysis.
Outline
3 // It computes the mean and median of the data.
4 #include <iostream>
fig04_17.cpp
5
(1 of 8)
6 using std::cout;
7 using std::endl;
8 using std::fixed;
9 using std::showpoint;
10
11 #include <iomanip>
12
13 using std::setw;
14 using std::setprecision;
15
16 void mean( const int [], int );
17 void median( int [], int );
19 void bubbleSort( int[], int );
20 void printArray( const int[], int );
21
22 int main()
23 {
24 const int responseSize = 99; // size of array responses
25

 2003 Prentice Hall, Inc.

All rights reserved.
 42
26 int frequency[ 10 ] = { 0 }; // initialize array frequency
27
Outline
28 // initialize array responses
29 int response[ responseSize ] =
fig04_17.cpp
30 { 6, 7, 8, 9, 8, 7, 8, 9, 8, 9,
(2 of 8)
31 7, 8, 9, 5, 9, 8, 7, 8, 7, 8,
32 6, 7, 8, 9, 3, 9, 8, 7, 8, 7,
33 7, 8, 9, 8, 9, 8, 9, 7, 8, 9,
34 6, 7, 8, 7, 8, 7, 9, 8, 9, 2,
35 7, 8, 9, 8, 9, 8, 9, 7, 5, 3,
36 5, 6, 7, 2, 5, 3, 9, 4, 6, 4,
37 7, 8, 9, 6, 8, 7, 8, 9, 7, 8,
38 7, 4, 4, 2, 5, 3, 8, 7, 5, 6,
39 4, 5, 6, 1, 6, 5, 7, 8, 7 };
40
41 // process responses
42 mean( response, responseSize );
43 median( response, responseSize );
45
46 return 0; // indicates successful termination
47
48 } // end main
49

 2003 Prentice Hall, Inc.

All rights reserved.
 43
50 // calculate average of all response values
51 void mean( const int answer[], int arraySize )
Outline
52 {
53 int total = 0;
fig04_17.cpp
54
(3 of 8)
55 cout << "********\n Mean\n********\n";
56
57 // total response values
58 for ( int i = 0; i < arraySize; i++ )
59 total += answer[ i ];
60
61 // format and output results
62 cout << fixed << setprecision( 4 );
63
64 cout << "The mean is the average value of the data\n"
65 << "items. The mean is equal to the total of\n"
66 << "all the data items divided by the number\n"
We cast to a double to get
67 << "of data items (" << arraySize
68 << "). The mean value for\nthis run is: "
decimal points for the average
69 << total << " / " << arraySize << " = " (instead of an integer).
70 << static_cast< double >( total ) / arraySize
71 << "\n\n";
72
73 } // end function mean
74

 2003 Prentice Hall, Inc.

All rights reserved.
 44
75 // sort array and determine median element's value
76 void median( int answer[], int size )
Outline
77 {
78 cout << "\n********\n Median\n********\n"
fig04_17.cpp
79 << "The unsorted array of responses is";
Sort array by passing it to a (4 of 8)
80
81 printArray( answer, size ); //
function. This keeps the
output unsorted array
82
program modular.
83 bubbleSort( answer, size ); // sort array
84
85 cout << "\n\nThe sorted array is";
86 printArray( answer, size ); // output sorted array
87
88 // display median element
89 cout << "\n\nThe median is element " << size / 2
90 << " of\nthe sorted " << size
91 << " element array.\nFor this run the median is "
92 << answer[ size / 2 ] << "\n\n";
93
94 } // end function median
95

 2003 Prentice Hall, Inc.

All rights reserved.
 45
144
145 // function that sorts an array with bubble sort algorithm
Outline
146 void bubbleSort( int a[], int size )
147 {
fig04_17.cpp
148 int hold; // temporary location used to swap elements
(7 of 8)
149
150 // loop to control number of passes
151 for ( int pass = 1; pass < size; pass++ )
152
153 // loop to control number of comparisons per pass
154 for ( int j = 0; j < size - 1; j++ )
155
156 // swap elements if out of order
157 if ( a[ j ] > a[ j + 1 ] ) {
158 hold = a[ j ];
159 a[ j ] = a[ j + 1 ];
160 a[ j + 1 ] = hold;
161
162 } // end if
163
164 } // end function bubbleSort
165

 2003 Prentice Hall, Inc.

All rights reserved.
 46
166 // output array contents (20 values per row)
167 void printArray( const int a[], int size )
Outline
168 {
169 for ( int i = 0; i < size; i++ ) {
fig04_17.cpp
170
(8 of 8)
171 if ( i % 20 == 0 ) // begin new line every 20 values
172 cout << endl;
173
174 cout << setw( 2 ) << a[ i ];
175
176 } // end for
177
178 } // end function printArray

 2003 Prentice Hall, Inc.

All rights reserved.
 47
********
Mean
Outline
********
The mean is the average value of the data
fig04_17.cpp
items. The mean is equal to the total of
output (1 of 2)
all the data items divided by the number
of data items (99). The mean value for
this run is: 681 / 99 = 6.8788
********
Median
********
The unsorted array of responses is
6 7 8 9 8 7 8 9 8 9 7 8 9 5 9 8 7 8 7 8
6 7 8 9 3 9 8 7 8 7 7 8 9 8 9 8 9 7 8 9
6 7 8 7 8 7 9 8 9 2 7 8 9 8 9 8 9 7 5 3
5 6 7 2 5 3 9 4 6 4 7 8 9 6 8 7 8 9 7 8
7 4 4 2 5 3 8 7 5 6 4 5 6 1 6 5 7 8 7

The sorted array is

1 2 2 2 3 3 3 3 4 4 4 4 4 5 5 5 5 5 5 5
5 6 6 6 6 6 6 6 6 6 7 7 7 7 7 7 7 7 7 7
7 7 7 7 7 7 7 7 7 7 7 7 7 8 8 8 8 8 8 8
8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8
9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9

The median is element 49 of

the sorted 99 element array.
For this run the median is 7
 2003 Prentice Hall, Inc.
All rights reserved.
 48

Searching Arrays

• Search array for a key value

• Linear search
– Compare each element of array with key value
• Start at one end, go to other
– Useful for small and unsorted arrays
• Inefficient
• If search key not present, examines every element

 2003 Prentice Hall, Inc. All rights reserved.

 49
1 // Fig. 4.19: fig04_19.cpp
2 // Linear search of an array.
Outline
3 #include <iostream>
4
fig04_19.cpp
5 using std::cout;
Takes array, search key, and (1 of 2)
6 using std::cin;
7 using std::endl;
array size.
8
9 int linearSearch( const int [], int, int ); // prototype
10
11 int main()
12 {
13 const int arraySize = 100; // size of array a
14 int a[ arraySize ]; // create array a
15 int searchKey; // value to locate in a
16
17 for ( int i = 0; i < arraySize; i++ ) // create some data
18 a[ i ] = 2 * i;
19
20 cout << "Enter integer search key: ";
21 cin >> searchKey;
22
23 // attempt to locate searchKey in array a
24 int element = linearSearch( a, searchKey, arraySize );
25

 2003 Prentice Hall, Inc.

All rights reserved.
 50
26 // display results
27 if ( element != -1 )
Outline
28 cout << "Found value in element " << element << endl;
29 else
fig04_19.cpp
30 cout << "Value not found" << endl;
(2 of 2)
31
32 return 0; // indicates successful termination
33
34 } // end main
35
36 // compare key to every element of array until location is
37 // found or until end of array is reached; return subscript of
38 // element if key or -1 if key not found
39 int linearSearch( const int array[], int key, int sizeOfArray )
40 {
41 for ( int j = 0; j < sizeOfArray; j++ )
42
43 if ( array[ j ] == key ) // if found,
44 return j; // return location of key
45
46 return -1; // key not found
47
48 } // end function linearSearch

 2003 Prentice Hall, Inc.

All rights reserved.
 51
Enter integer search key: 36
Found value in element 18
Outline

Enter integer search key: 37

fig04_19.cpp
Value not found
output (1 of 1)

 2003 Prentice Hall, Inc.

All rights reserved.
 52

Strings

• Strings
– Arrays of characters
– All strings end with null ('\0')
– Examples
• char string1[] = "hello";
– Null character implicitly added
– string1 has 6 elements
• char string1[] = { 'h', 'e', 'l', 'l',
'o', '\0’ };
– Subscripting is the same
String1[ 0 ] is 'h'
string1[ 2 ] is 'l'

 2003 Prentice Hall, Inc. All rights reserved.

 53

Strings

• Input from keyboard

char string2[ 10 ];
cin >> string2;
– Puts user input in string
• Stops at first whitespace character
• Adds null character
– If too much text entered, data written beyond array
• We want to avoid this (section 5.12 explains how)
• Printing strings
– cout << string2 << endl;
• Does not work for other array types
– Characters printed until null found

 2003 Prentice Hall, Inc. All rights reserved.

 54
1 // Fig. 4_12: fig04_12.cpp
2 // Treating character arrays as strings.
Outline
3 #include <iostream>
4
fig04_12.cpp
5 using std::cout;
(1 of 2)
6 using std::cin;
7 using std::endl;
8 Two different ways to declare
9 int main() strings. string2 is
10 { initialized, and its size
11 char string1[ 20 ], // determined
reserves 20automatically
characters .
12 char string2[] = "string literal"; // reserves 15 characters
13 Examples of reading strings
14 // read string from
from user into array the keyboard and
string2
15 cout << "Enter the string \"helloprinting them
there\": "; out.
16 cin >> string1; // reads "hello" [space terminates input]
17
18 // output strings
19 cout << "string1 is: " << string1
20 << "\nstring2 is: " << string2;
21
22 cout << "\nstring1 with spaces between characters is:\n";
23

 2003 Prentice Hall, Inc.

All rights reserved.
 55
24 // output characters until null character is reached
25 for ( int i = 0; string1[ i ] != '\0'; i++ )
Outline
26 cout << string1[ i ] << ' ';
27
Can access the characters in a fig04_12.cpp
28 cin >> string1; // reads "there"
string using array notation. (2 of 2)
29 cout << "\nstring1 is: " << string1 << endl;
30
The loop ends when the null
31 return 0; // indicates successful character is found.
termination fig04_12.cpp
32 output (1 of 1)
33 } // end main

Enter the string "hello there": hello there

string1 is: hello
string2 is: string literal
string1 with spaces between characters is:
h e l l o
string1 is: there

 2003 Prentice Hall, Inc.

All rights reserved.
 56

Multiple-Subscripted Arrays

• Multiple subscripts
– a[ i ][ j ]
– Tables with rows and columns
– Specify row, then column
– “Array of arrays”
• a[0] is an array of 4 elements
• a[0][0] is the first element of that array
Column 0 Column 1 Column 2 Column 3
Row 0 a[ 0 ][ 0 ] a[ 0 ][ 1 ] a[ 0 ][ 2 ] a[ 0 ][ 3 ]

Row 1 a[ 1 ][ 0 ] a[ 1 ][ 1 ] a[ 1 ][ 2 ] a[ 1 ][ 3 ]

Row 2 a[ 2 ][ 0 ] a[ 2 ][ 1 ] a[ 2 ][ 2 ] a[ 2 ][ 3 ]

Column subscript

Array name
Row subscript

 2003 Prentice Hall, Inc. All rights reserved.

 57

Multiple-Subscripted Arrays

• To initialize
– Default of 0
– Initializers grouped by row in braces
1 2
int b[ 2 ][ 2 ] = { { 1, 2 }, { 3, 4 } }; 3 4
Row 0 Row 1

1 0

int b[ 2 ][ 2 ] = { { 1 }, { 3, 4 } }; 3 4

 2003 Prentice Hall, Inc. All rights reserved.

 58

Multiple-Subscripted Arrays

• Referenced like normal

cout << b[ 0 ][ 1 ]; 1 0

– Outputs 0 3 4

– Cannot reference using commas

cout << b[ 0, 1 ];
• Syntax error
• Function prototypes
– Must specify sizes of subscripts
• First subscript not necessary, as with single-scripted arrays
– void printArray( int [][ 3 ] );

 2003 Prentice Hall, Inc. All rights reserved.

 59
1 // Fig. 4.22: fig04_22.cpp
2 // Initializing multidimensional arrays.
Outline
3 #include <iostream>
4 Note the format of the fig04_22.cpp
5 using std::cout; prototype. (1 of 2)
6 using std::endl;
7 Note the various initialization
8 void printArray( int [][ 3 ] ); styles. The elements in
9
array2 are assigned to the
10 int main()
first row and then the second.
11 {
12 int array1[ 2 ][ 3 ] = { { 1, 2, 3 }, { 4, 5, 6 } };
13 int array2[ 2 ][ 3 ] = { 1, 2, 3, 4, 5 };
14 int array3[ 2 ][ 3 ] = { { 1, 2 }, { 4 } };
15
16 cout << "Values in array1 by row are:" << endl;
17 printArray( array1 );
18
19 cout << "Values in array2 by row are:" << endl;
20 printArray( array2 );
21
22 cout << "Values in array3 by row are:" << endl;
23 printArray( array3 );
24
25 return 0; // indicates successful termination
26
27 } // end main

 2003 Prentice Hall, Inc.

All rights reserved.
 60
28
29
For loops are often used to
// function to output array with two rows and three columns
Outline
30 void printArray( int a[][ 3 ] ) iterate through arrays. Nested
31 { loops are helpful with
fig04_22.cpp
32 for ( int i = 0; i < 2; i++ ) { // formultiple-subscripted
each row arrays.
(2 of 2)
33
34 for ( int j = 0; j < 3; j++ ) // output column values
35 cout << a[ i ][ j ] << ' '; fig04_22.cpp
36 output (1 of 1)
37 cout << endl; // start new line of output
38
39 } // end outer for structure
40
41 } // end function printArray

Values in array1 by row are:

1 2 3
4 5 6
Values in array2 by row are:
1 2 3
4 5 0
Values in array3 by row are:
1 2 0
4 0 0

 2003 Prentice Hall, Inc.

All rights reserved.
 61

Multiple-Subscripted Arrays

• Next: program showing initialization

– After, program to keep track of students grades
– Multiple-subscripted array (table)
– Rows are students
– Columns are grades Quiz1 Quiz2

Student0 95 85
Student1 89 80

 2003 Prentice Hall, Inc. All rights reserved.

 62
1 // Fig. 4.23: fig04_23.cpp
2 // Double-subscripted array example.
Outline
3 #include <iostream>
4
fig04_23.cpp
5 using std::cout;
(1 of 6)
6 using std::endl;
7 using std::fixed;
8 using std::left;
9
10 #include <iomanip>
11
12 using std::setw;
13 using std::setprecision;
14
15 const int students = 3; // number of students
16 const int exams = 4; // number of exams
17
18 // function prototypes
19 int minimum( int [][ exams ], int, int );
20 int maximum( int [][ exams ], int, int );
21 double average( int [], int );
22 void printArray( int [][ exams ], int, int );
23

 2003 Prentice Hall, Inc.

All rights reserved.
 63
24 int main()
25 {
Outline
26 // initialize student grades for three students (rows)
27 int studentGrades[ students ][ exams ] =
fig04_23.cpp
28 { { 77, 68, 86, 73 },
(2 of 6)
29 { 96, 87, 89, 78 },
30 { 70, 90, 86, 81 } };
31
32 // output array studentGrades
33 cout << "The array is:\n";
34 printArray( studentGrades, students, exams );
35
36 // determine smallest and largest grade values
37 cout << "\n\nLowest grade: "
38 << minimum( studentGrades, students, exams )
39 << "\nHighest grade: "
40 << maximum( studentGrades, students, exams ) << '\n';
41
42 cout << fixed << setprecision( 2 );
43

 2003 Prentice Hall, Inc.

All rights reserved.
 64
44 // calculate average grade for each student
45 for ( int person = 0; person < students; person++ )
Outline
46 cout << "The average grade for student " << person
47 << " is "
fig04_23.cpp
48 << average( studentGrades[ person ], exams )
(3 of 6)
49 << endl;
50 Determines the average for
51 return 0; // indicates successful termination
one student. We pass the
52
array/row containing the
53 } // end main
student’s grades. Note that
54
55 // find minimum grade
studentGrades[0] is
56 int minimum( int grades[][ itself
exams ], int pupils, intantests
array. )
57 {
58 int lowGrade = 100; // initialize to highest possible grade
59
60 for ( int i = 0; i < pupils; i++ )
61
62 for ( int j = 0; j < tests; j++ )
63
64 if ( grades[ i ][ j ] < lowGrade )
65 lowGrade = grades[ i ][ j ];
66
67 return lowGrade;
68
69 } // end function minimum

 2003 Prentice Hall, Inc.

All rights reserved.
 65
70
71 // find maximum grade
Outline
72 int maximum( int grades[][ exams ], int pupils, int tests )
73 {
fig04_23.cpp
74 int highGrade = 0; // initialize to lowest possible grade
(4 of 6)
75
76 for ( int i = 0; i < pupils; i++ )
77
78 for ( int j = 0; j < tests; j++ )
79
80 if ( grades[ i ][ j ] > highGrade )
81 highGrade = grades[ i ][ j ];
82
83 return highGrade;
84
85 } // end function maximum
86

 2003 Prentice Hall, Inc.

All rights reserved.
 66
87 // determine average grade for particular student
88 double average( int setOfGrades[], int tests )
Outline
89 {
90 int total = 0;
fig04_23.cpp
91
(5 of 6)
92 // total all grades for one student
93 for ( int i = 0; i < tests; i++ )
94 total += setOfGrades[ i ];
95
96 return static_cast< double >( total ) / tests; // average
97
98 } // end function maximum

 2003 Prentice Hall, Inc.

All rights reserved.
 67
99
100 // Print the array
Outline
101 void printArray( int grades[][ exams ], int pupils, int tests )
102 {
fig04_23.cpp
103 // set left justification and output column heads
(6 of 6)
104 cout << left << " [0] [1] [2] [3]";
105
106 // output grades in tabular format
107 for ( int i = 0; i < pupils; i++ ) {
108
109 // output label for row
110 cout << "\nstudentGrades[" << i << "] ";
111
112 // output one grades for one student
113 for ( int j = 0; j < tests; j++ )
114 cout << setw( 5 ) << grades[ i ][ j ];
115
116 } // end outer for
117
118 } // end function printArray

 2003 Prentice Hall, Inc.

All rights reserved.
 68
The array is:
[0] [1] [2] [3]
Outline
studentGrades[0] 77 68 86 73
studentGrades[1] 96 87 89 78
fig04_23.cpp
studentGrades[2] 70 90 86 81
output (1 of 1)
Lowest grade: 68
Highest grade: 96
The average grade for student 0 is 76.00
The average grade for student 1 is 87.50
The average grade for student 2 is 81.75

 2003 Prentice Hall, Inc.

All rights reserved.