Chapter 7 - Arrays

1
Chapter 6 - Arrays
2000 Prentice Hall, Inc.

All rights reserved.
6.1
Introduction
Arrays
Structures of related data items
Static entity same size throughout program
Dynamic data structures discussed in Chapter 12

6.2
Arrays
Array
Group of consecutive memory locations
Same name and type
To refer to an element, specify

Array name
Position number
Format:
arrayname[ position number ]
First element at position 0

n element array named c:
Name of array
(Note that all
elements of this
array have the
same name, c)
c[0]
-45
c[1]
c[2]
c[3]
72
c[4]
1543
c[5]
-89
c[6]
c[7]
62
c[8]
-3
c[9]
c[10]
6453
c[11]
78
c[ 0 ], c[ 1 ]...c[ n 1 ]
Position number
of the element
2000 Prentice
within array
c Hall, Inc.
6.2
Arrays
Array elements are like normal variables

c[ 0 ] = 3;
printf( "%d", c[ 0 ] );
Perform operations in subscript. If x equals 3

c[ 5 - 2 ] == c[ 3 ] == c[ x ]

6.3
Declaring Arrays
When declaring arrays, specify

Name
Type of array
Number of elements
arrayType arrayName[ numberOfElements ];
Examples:
int c[ 10 ];
float myArray[ 3284 ];
Declaring multiple arrays of same type

Format similar to regular variables
Example:
int b[ 100 ], x[ 27 ];

6.4
Examples Using Arrays
Initializers
int n[ 5 ] = { 1, 2, 3, 4, 5 };
If not enough initializers, rightmost elements become 0

int n[ 5 ] = { 0 }
All elements 0
C arrays have no bounds checking
If size omitted, initializers determine it

int n[ ] = { 1, 2, 3, 4, 5 };
5 initializers, therefore 5 element array

1
2
3
/* Fig. 6.8: fig06_08.c

Histogram printing program */
#include <stdio.h>
4
5
6
7
#define SIZE 10
Outline
1. Initialize array
int main()
{
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23 }
2. Loop
int n[ SIZE ] = { 19, 3, 15, 7, 11, 9, 13, 5, 17, 1 };

int i, j;
3. Print
printf( "%s%13s%17s\n", "Element", "Value", "Histogram" );

for ( i = 0; i <= SIZE - 1; i++ ) {
printf( "%7d%13d
", i, n[ i ]) ;
for ( j = 1; j <= n[ i ]; j++ )
printf( "%c", '*' );
/* print one bar */
printf( "\n" );
}
return 0;

Element
0
1
2
3
4
5
6
7
8
9
Value
19
3
15
7
11
9
13
5
17
1
Histogram
*******************
***
***************
*******
***********
*********
*************
*****
*****************
*
Outline
Program Output

6.4
Examples Using Arrays
Character arrays
String first is really a static array of characters
Character arrays can be initialized using string literals
char string1[] = "first";
Null character '\0' terminates strings
string1 actually has 6 elements
It is equivalent to
char string1[] = { 'f', 'i', 'r', 's', 't', '\0' };
Can access individual characters

string1[ 3 ] is character s
Array name is address of array, so & not needed for scanf

scanf( "%s", string2 );
Reads characters until whitespace encountered
Can write beyond end of array, be careful

/* Fig. 6.10: fig06_10.c
2
3
Outline
Treating character arrays as strings */

#include <stdio.h>
4
5
int main()
10
1. Initialize strings
2. Print strings
char string1[ 20 ], string2[] = "string literal";
int i;
2.1 Define loop
10
printf(" Enter a string: ");
11
scanf( "%s", string1 );
12
printf( "string1 is: %s\nstring2: is %s\n"
2.2 Print characters

individually
13
"string1 with spaces between characters is:\n",
14
string1, string2 );
2.3 Input string
15
16
for ( i = 0; string1[ i ] != '\0'; i++ )
17
3. Print string
printf( "%c ", string1[ i ] );
18
19
printf( "\n" );
20
return 0;
21 }
Enter a
string1
string2
string1
H e l l
string: Hello there

is: Hello
is: string literal
with spaces between characters is:
o
Program Output

11
6.5
Passing Arrays to Functions
Passing arrays
To pass an array argument to a function, specify the name of
the array without any brackets
int myArray[ 24 ];
myFunction( myArray, 24 );
Array size usually passed to function
Arrays passed call-by-reference

Name of array is address of first element
Function knows where the array is stored
Modifies original memory locations
Passing array elements

Passed by call-by-value
Pass subscripted name (i.e., myArray[ 3 ]) to function

12
6.5
Passing Arrays to Functions
Function prototype
void modifyArray( int b[], int arraySize );
Parameter names optional in prototype

int b[] could be written int []
int arraySize could be simply int

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
/* Fig. 6.13: fig06_13.c

Passing arrays and individual array elements to functions */
#include <stdio.h>
#define SIZE 5
void modifyArray( int [], int );
void modifyElement( int );
Outline
13
1. Function definitions
/* appears strange */
2. Pass array to a
function
int main()
{
int a[ SIZE ] = { 0, 1, 2, 3, 4 }, i;
printf( "Effects of passing entire array call "
"by reference:\n\nThe values of the "
"original array are:\n" );
for ( i = 0; i <= SIZE - 1; i++ )
printf( "%3d", a[ i ] );
2.1 Pass array element

to a function
3. Print
Entire arrays passed call-byreference, and can be modified
printf( "\n" );
modifyArray( a, SIZE ); /* passed call by reference */
printf( "The values of the modified array are:\n" );
for ( i = 0; i <= SIZE - 1; i++ )
printf( "%3d", a[ i ] );
Array elements passed call-byvalue, and cannot be modified
printf( "\n\n\nEffects of passing array element call "

"by value:\n\nThe value of a[3] is %d\n", a[ 3 ] );
modifyElement( a[ 3 ] );
printf( "The value of a[ 3 ] is %d\n", a[ 3 ] );
return 0;
}

33
Outline
34 void modifyArray( int b[], int size )

35 {
36
14
3.1 Function definitions
int j;
37
38
39
for ( j = 0; j <= size - 1; j++ )

b[ j ] *= 2;
40 }
41
42 void modifyElement( int e )
43 {
44
printf( "Value in modifyElement is %d\n", e *= 2 );
45 }
Effects of passing entire array call by reference:
The values of
0 1 2 3
The values of
0 2 4 6
the original array are:

4
the modified array are:
8
Program Output
Effects of passing array element call by value:

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

15
6.6
Sorting Arrays
Sorting data
Important computing application
Virtually every organization must sort some data
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
Example:
original: 3 4 2 6 7
pass 1:
3 2 4 6 7
pass 2:
2 3 4 6 7
Small elements "bubble" to the top/ large elements at the last

Bubble Sort Example

2,6,9,11,9,3,7,12
First Pass
6,
Second Pass
2,
Third Pass
2,
Fourth Pass
2,
Fifth Pass
2,
Sixth Pass
2,
2,
6,
6,
6,
3,
3,
9,
9,
9,
3,
6,
6,
11, 9, 3, 7,
9, 3, 7, 11,
3, 7, 9, 11,
7, 9, 9, 11,
7, 9, 9, 11,
7, 9, 9, 11,
12
12
12
12
12
12
This
Thispass
passno
noexchanges
exchangesare
aremade
madeso
sothe
thealgorithm
algorithmknows
knowsthe
thelist
listisis
sorted.
sorted. ItItcan
cantherefore
thereforesave
savetime
timeby
bynot
notdoing
doingthe
thefinal
finalpass.
pass. With
With
other
otherlists
liststhis
thischeck
checkcould
couldsave
savemuch
muchmore
morework.
work.

6.7
Case Study: Computing Mean, Median

and Mode Using Arrays
Mean average
Median number in middle of sorted list
17
1, 2, 3, 4, 5
3 is the median
Mode number that occurs most often

1, 1, 1, 2, 3, 3, 4, 5
1 is the mode

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
/* Fig. 6.16: fig06_16.c

This program introduces the topic of survey data analysis.
It computes the mean, median, and mode of the data */
#include <stdio.h>
#define SIZE 99
void
void
void
void
void
mean( const int [] );

median( int [] );
mode( int [], const int [] ) ;
bubbleSort( int [] );
printArray( const int [] );
int main()
{
int frequency[ 10 ] = { 0
int response[ SIZE ] =
{ 6, 7, 8, 9, 8, 7, 8,
7, 8, 9, 5, 9, 8, 7,
6, 7, 8, 9, 3, 9, 8,
7, 8, 9, 8, 9, 8, 9,
6, 7, 8, 7, 8, 7, 9,
7, 8, 9, 8, 9, 8, 9,
5, 6, 7, 2, 5, 3, 9,
7, 8, 9, 6, 8, 7, 8,
7, 4, 4, 2, 5, 3, 8,
4, 5, 6, 1, 6, 5, 7,
1. Function prototypes
1.1 Initialize array
2. Call functions mean,
median, and mode
};
9,
8,
7,
7,
8,
7,
4,
9,
7,
8,
mean( response );
median( response );
mode( frequency, response );
return 0;
}
Outline
18
8, 9,
7, 8,
8, 7,
8, 9,
9, 2,
5, 3,
6, 4,
7, 8,
5, 6,
7 };

33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
Outline
void mean( const int answer[] )

{
int j, total = 0;
printf( "%s\n%s\n%s\n", "********", "
Mean", "********" );
for ( j = 0; j <= SIZE - 1; j++ )

total += answer[ j ];
printf( "The mean is the average value of the data\n"
"items. The mean is equal to the total of\n"
"all the data items divided by the number\n"
"of data items ( %d ). The mean value for\n"
"this run is: %d / %d = %.4f\n\n",
SIZE, total, SIZE, ( double ) total / SIZE );
}
19
3. Define function
mean
3.1 Define function
median
3.1.1 Sort Array
3.1.2 Print middle
element
void median( int answer[] )

{
printf( "\n%s\n%s\n%s\n%s",
"********", " Median", "********",
"The unsorted array of responses is" );
printArray( answer );
bubbleSort( answer );
printf( "\n\nThe sorted array is" );
printArray( answer );
printf( "\n\nThe median is element %d of\n"
"the sorted %d element array.\n"
"For this run the median is %d\n\n",
SIZE / 2, SIZE, answer[ SIZE / 2 ] );

65 }
66
67 void mode( int freq[], const int answer[] )
68 {
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
Outline
3.2 Define function
mode
int rating, j, h, largest = 0, modeValue = 0;
3.2.1 Increase
frequency[]
depending on
response[]
printf( "\n%s\n%s\n%s\n",
"********", "
Mode", "********" );
for ( rating = 1; rating <= 9; rating++ )

freq[ rating ] = 0;
for ( j = 0; j <= SIZE - 1; j++ )
++freq[ answer[ j ] ];
20
Notice how the subscript in

frequency[] is the value of an
element in response[]
(answer[])
printf( "%s%11s%19s\n\n%54s\n%54s\n\n",
"Response", "Frequency", "Histogram",
"1
1
2
2", "5
0
5
0
5" );
for ( rating = 1; rating <= 9; rating++ ) {

printf( "%8d%11d
", rating, freq[ rating ] );
if ( freq[ rating ] > largest ) {

largest = freq[ rating ];
modeValue = rating;
}
for ( h = 1; h <= freq[ rating ]; h++ )
printf( "*" );
Print stars depending on value of

frequency[]

95
printf( "\n" );
96
}
97
98
printf( "The mode is the most frequent value.\n"
99
"For this run the mode is %d which occurred"
100
" %d times.\n", modeValue, largest );
101 }
102
103 void bubbleSort( int a[] )
104 {
105
int pass, j, hold;
106
107
for ( pass = 1; pass <= SIZE - 1; pass++ )
108
109
for ( j = 0; j <= SIZE - 2; j++ )
110
111
if ( a[ j ] > a[ j + 1 ] ) {
112
hold = a[ j ];
Bubble sort:
113
a[ j ] = a[ j + 1 ];
swap them.
114
a[ j + 1 ] = hold;
115
}
116 }
117
118 void printArray( const int a[] )
119 {
120
int j;
121
122
for ( j = 0; j <= SIZE - 1; j++ ) {
123
124
if ( j % 20 == 0 )
125
printf( "\n" );
Outline
21
3.3 Define bubbleSort

3.3 Define printArray
if elements out of order,

126
127
128
Outline
printf( "%2d", a[ j ] );
22
129 }
********
Mean
********
The mean is the average value of the data
items. The mean is equal to the total of
all the data items divided by the number
of data items (99). The mean value for
this run is: 681 / 99 = 6.8788
Program Output
********
Median
********
The unsorted array of responses is
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
1 2 2 2 3
5 6 6 6 6
7 7 7 7 7
8 8 8 8 8
9 9 9 9 9
array
3 3 3
6 6 6
7 7 7
8 8 8
9 9 9
is
4 4
6 6
7 7
8 8
9 9
4
7
7
8
9
4
7
7
8
9
4
7
7
8
9
5
7
8
8
9
5
7
8
8
9
5
7
8
8
9
5
7
8
8
9
5
7
8
8
9
5
7
8
8
9
5
7
8
8
The median is element 49 of

the sorted 99 element array.
For this run the median is 7

********
Mode
********
Response
Outline
Frequency
Program Output
Histogram
5
23
1
0
1
5
2
0
2
5
1
1
*
2
3
***
3
4
****
4
5
*****
5
8
********
6
9
*********
7
23
***********************
8
27
***************************
9
19
*******************
The mode is the most frequent value.
For this run the mode is 8 which occurred 27 times.

6.8
Searching Arrays: Linear Search and

Binary Search
Search an array for a key value
Linear search
24
Simple
Compare each element of array with key value
Useful for small and unsorted arrays

6.8
Searching Arrays: Linear Search and

Binary Search
Binary search
25
For sorted arrays

Compares middle element with key
If equal, match found

If key < middle, looks in first half of array
If key > middle, looks in last half
Repeat
Very fast; at most n steps, where 2n > number of elements

5
30 element
array takes at most 5 steps
25 > 30 so at most 5 steps

Binary Search, cont.

key = 11
[0] [1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12]
list
10 11 45
key < 50
50 59 60 66 69 70 79
mid
[0] [1] [2] [3] [4] [5]

2
key > 7
10 11 45
mid
[3] [4] [5]
10 11 45
key = 11
mid

27
Two Dimensional Arrays
CSE202: Lecture 16
The Ohio State University

CSE202: Lecture 16
Two-dimensional Arrays
A two-dimensional array consists of both rows and
columns of elements. It is essentially a matrix.
To declare a two-dimensional array, we merely use
two sets of square brackets.
The first contains the number of rows
The second contains the number of columns
//Creates a 2D array with 3 rows and 4 columns
int vals[3][4];

28
29
Indices in 2D arrays
Assume that the two dimensional array called val is
declared and looks like the following:
val
Col 0 Col 1 Col 2 Col 3
Row 0
16
52
Row 1
15
27
Row 2
14
25
10
To access the cell containing 6, we reference val[1]

[3], that is, row 1, column 3.
CSE202: Lecture 16

CSE202: Lecture 16
Using 2D arrays
Just like 1D arrays, once you have specified the
index, you are just working with a single variable
of the given data type.
Assignments and usage is still the same:
sumRow0 = val[0][0] + val[0][1] + val[0][2] +
val[0][3];
//assigns 72 to cell at row 2, column 3
val[2][3] = 72;

30
Initializing 2D arrays
You can use additional braces to indicate when rows start
and end, but you dont have to do that.
int val[3][4] = { {8,16,9,52},
{3,15,27,6},
{14,25,2,10}
};
Or
int val[3][4] = {8,16,9,52,
3,15,27,6,
14,25,2,10};
Or (correct, but not as clear as the first two):

int val[3][4] =
{8,16,9,52,3,15,27,6,14,25,2,10};

31
More on 2D arrays
Initialization of 2D arrays is done in row order.
2D arrays work well with (for) loops like 1D
arrays. However, to access all elements, typically
you will need nested loops for 2D arrays. Can you
see why?

32
Example Program
...
int main()
{
const int NUM_ROW(3);
const int NUM_COL(4);
int vals[NUM_ROW][NUM_COL] = { {11, 12, 13, 14},
{21, 22, 23, 24},
{31, 32, 33, 34} };
// output the array
for (int row = 0; row < NUM_ROW; row++)
{
for (int col = 0; col < NUM_COL; col++)
{
cout << vals[row][col] << " ";
}
cout << endl;
}
...

33
Example Program
...
{21, 22, 23, 24},
{31, 32, 33, 34} };
// output the array
{
{
}
cout << endl;
}
...
> array2DExample.exe
11 12 13 14
21 22 23 24
31 32 33 34

34
Example Program (2)

...
int main()
{
const int NUM_ROW(3);
const int NUM_COL(4);
{21, 22, 23, 24},
{31, 32, 33, 34} };
// output the transpose of the array
{
{
}
cout << endl;
}
...

35
Matrix Addition Algorithm

Add two n x m matrices A, B;
for each row i of A do
for each column j of A do

C[i][j] = A[i][j] + B[i][j];
Output matrices A, B and C.

36
matrixAdd.cpp
...
int main()
{
const int NUM_ROWS(3);
const int NUM_COLS(2);
// number of matrix rows

// number of matrix columns
// Note: A, B and C have the same dimensions

double A[NUM_ROWS][NUM_COLS] = { {3, 3}, {1, 1}, {2, 0} };
double B[NUM_ROWS][NUM_COLS] = { {3, 0}, {3, 0}, {0, 1} };
double C[NUM_ROWS][NUM_COLS];
// C = A + B
for (int i=0; i<NUM_ROWS; i++)
{
for (int j=0; j<NUM_COLS; j++)
{
C[i][j] = A[i][j] + B[i][j];
}
}
...

37
matrixAdd.cpp (2)
...
// display A
cout << "A =" << endl;
for (int i=0; i<NUM_ROWS; i++)
{
for (int j=0; j<NUM_COLS; j++)
{
cout << "
" << A[i][j] << " ";
}
cout << endl;
}
cout << endl;
...

38
6.9
Multiple-Subscripted Arrays
Multiple subscripted arrays

Tables with rows and columns (m by n array)
Like matrices: specify row, then column
Column 0 Column 1 Column 2 Column 3
Row 0
Row 1
Row 2
a[ 0 ][ 0 ] a[ 0 ][ 1 ] a[ 0 ][ 2 ] a[ 0 ][ 3 ]
a[ 1 ][ 0 ] a[ 1 ][ 1 ] a[ 1 ][ 2 ] a[ 1 ][ 3 ]
a[ 2 ][ 0 ] a[ 2 ][ 1 ] a[ 2 ][ 2 ] a[ 2 ][ 3 ]
Column subscript
Array
name Row subscript

6.9
Multiple-Subscripted Arrays
Initialization
int b[ 2 ][ 2 ] = { { 1, 2 }, { 3, 4 } };
Initializers grouped by row in braces
If not enough, unspecified elements set to zero
int b[ 2 ][ 2 ] = { { 1 }, { 3, 4 } };
Referencing elements
Specify row, then column

printf( "%d", b[ 0 ][ 1 ] );

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
/* Fig. 6.22: fig06_22.c

Double-subscripted array example */
#include <stdio.h>
#define STUDENTS 3
#define EXAMS 4
int minimum( const int [][ EXAMS ], int, int );
int maximum( const int [][ EXAMS ], int, int );
double average( const int [], int );
void printArray( const int [][ EXAMS ], int, int );
int main()
{
int student;
const int studentGrades[ STUDENTS ][ EXAMS ] =
{ { 77, 68, 86, 73 },
{ 96, 87, 89, 78 },
{ 70, 90, 86, 81 } };
Outline
41
1. Initialize variables
1.1 Define functions to
take double scripted
arrays
Each row is a particular student,
each column is the grades on the
1.2 Initialize
exam.
studentgrades[][]
2. Call functions
minimum, maximum,
and average
printf( "The array is:\n" );

printArray( studentGrades, STUDENTS, EXAMS );
printf( "\n\nLowest grade: %d\nHighest grade: %d\n",
minimum( studentGrades, STUDENTS, EXAMS ),
maximum( studentGrades, STUDENTS, EXAMS ) );
for ( student = 0; student <= STUDENTS - 1; student++ )
printf( "The average grade for student %d is %.2f\n",
student,
average( studentGrades[ student ], EXAMS ) );
return 0;
}

33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
/* Find the minimum grade */

int minimum( const int grades[][ EXAMS ],
int pupils, int tests )
{
int i, j, lowGrade = 100;
Outline
42
3. Define functions
for ( i = 0; i <= pupils - 1; i++ )

for ( j = 0; j <= tests - 1; j++ )
if ( grades[ i ][ j ] < lowGrade )
lowGrade = grades[ i ][ j ];
return lowGrade;
}
/* Find the maximum grade */
int maximum( const int grades[][ EXAMS ],
{
int i, j, highGrade = 0;
for ( i = 0; i <= pupils - 1; i++ )
for ( j = 0; j <= tests - 1; j++ )
if ( grades[ i ][ j ] > highGrade )
highGrade = grades[ i ][ j ];
return highGrade;
}
/* Determine the average grade for a particular exam */
double average( const int setOfGrades[], int tests )
{

65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
int i, total = 0;
Outline
for ( i = 0; i <= tests - 1; i++ )

total += setOfGrades[ i ];
43
3. Define functions
return ( double ) total / tests;

}
/* Print the array */
void printArray( const int grades[][ EXAMS ],
{
int i, j;
printf( "
[0]
[1]
[2]
[3]" );
for ( i = 0; i <= pupils - 1; i++ ) {

printf( "\nstudentGrades[%d] ", i );
for ( j = 0; j <= tests - 1; j++ )
printf( "%-5d", grades[ i ][ j ] );
}
}

Outline
The array is:

[0]
studentGrades[0] 77
studentGrades[1] 96
studentGrades[2] 70
[1]
68
87
90
[2]
86
89
86
[3]
73
78
81
44
Program Output
Lowest grade: 68
Highest grade: 96
The average grade for student 0 is 76.00

45
Programs to try
Find the maximum element in an array.
Count the no. of vowels, consonants, spaces in the
given text.
Find the row sum , column sum in the given
matrix.
Find the addition, subtraction, Multiplication of
two matrices
Write the function extract a substring from a
string.
Convert an integer to binary value

46
read student scores (int) from the keyboard, get the best score, and then assign grades
based on the following scheme:
Grade is A if score is >= best10;
Grade is B if score is >= best20;
Grade is C if score is >= best30;
Grade is D if score is >= best40;
Grade is F otherwise.

Strings

Type Qualifier - const
48
//Pointer to constant int

int const *PtrVar;
//Pointer to constant int
int const (*PtrVar);
//Constant pointer to int
int *const PtrVar;
//Constant pointer to int
int (*const PtrVar)

49
Type Qualifier -Volatile

It is a type qualifier used to declare an object or
variable value that can be modified by other than
the statement in the source codes itself, such as
interrupt service routine and memory-mapped I/O
port or concurrent thread execution. Keep in mind that although we have to concern
about these volatile variable or object, most of the
compilers nowadays have their own
implementation how to handle this situation
mainly for Win32 applications.

50
Type Qualifier : Volatile

When declaring an object to be volatile, we tell the compiler not
to make any assumptions concerning the value of the object
while evaluating expressions in which it occurs because the value
could change at any moment. When a name is declared as volatile, the compiler reloads the
value from memory each time it is accessed by the program.
Every reference to the variable will reload the contents from
memory rather than take advantage of situations where a copy
can be in a register.

51
DECLARATION - VOLATILE
Declaring volatile variable. For example, volatile integer.
volatile int Vint;
int volatile Vint;
Declaring pointers to volatile variables.
volatile int * Vintptr; // pointer to volatile integer.
int volatile * Vintptr;
Declaring volatile pointer to non volatile variables.
int * volatile Vptr; // volatile pointer to integer.
Declaring volatile pointer to a volatile variable.
int volatile * volatile Vptr; // volatile pointer to volatile integer.
Using typedef example.
typedef volatile int Vint

52
const int *p
p is a pointer to an int and where that pointer points
can not be changed by the programmer whereas
Volatile int *q
q is a pointer to an int and where that pointer points could
be changed by someone other than the programmer so the
compiler makes no assumptions about that pointer.

53
Preprocessor directives
Difference between
# define n 10
no symbol in symbol table , macro
const int n 10
an identifier in symbol table


Chapter 7 - Arrays

Caricato da

Informazioni sul documento

Copyright

Formati disponibili

Condividi questo documento

Condividi o incorpora il documento

Opzioni di condivisione

Hai trovato utile questo documento?

Questo contenuto è inappropriato?

Copyright:

Formati disponibili

Chapter 7 - Arrays

Caricato da

Copyright:

Formati disponibili

1

2000 Prentice Hall, Inc.

2000 Prentice Hall, Inc.

To refer to an element, specify

First element at position 0

Array elements are like normal variables

Perform operations in subscript. If x equals 3

2000 Prentice Hall, Inc.

When declaring arrays, specify

Declaring multiple arrays of same type

2000 Prentice Hall, Inc.

Examples Using Arrays

If not enough initializers, rightmost elements become 0

C arrays have no bounds checking

If size omitted, initializers determine it

5 initializers, therefore 5 element array

2000 Prentice Hall, Inc.

/* Fig. 6.8: fig06_08.c

int n[ SIZE ] = { 19, 3, 15, 7, 11, 9, 13, 5, 17, 1 };

printf( "%s%13s%17s\n", "Element", "Value", "Histogram" );

/* print one bar */

2000 Prentice Hall, Inc.

2000 Prentice Hall, Inc.

Examples Using Arrays

Can access individual characters

Array name is address of array, so & not needed for scanf

2000 Prentice Hall, Inc.

/* Fig. 6.10: fig06_10.c

Treating character arrays as strings */

char string1[ 20 ], string2[] = "string literal";

2.1 Define loop

printf(" Enter a string: ");

scanf( "%s", string1 );

printf( "string1 is: %s\nstring2: is %s\n"

2.2 Print characters

"string1 with spaces between characters is:\n",

2.3 Input string

for ( i = 0; string1[ i ] != '\0'; i++ )

printf( "%c ", string1[ i ] );

string: Hello there

2000 Prentice Hall, Inc.

Passing Arrays to Functions

Arrays passed call-by-reference

Passing array elements

2000 Prentice Hall, Inc.

Passing Arrays to Functions

Parameter names optional in prototype

2000 Prentice Hall, Inc.

/* Fig. 6.13: fig06_13.c

2.1 Pass array element

Array elements passed call-byvalue, and cannot be modified

printf( "\n\n\nEffects of passing array element call "

2000 Prentice Hall, Inc.

34 void modifyArray( int b[], int size )

3.1 Function definitions

for ( j = 0; j <= size - 1; j++ )

printf( "Value in modifyElement is %d\n", e *= 2 );

the original array are:

Effects of passing array element call by value:

2000 Prentice Hall, Inc.

Bubble sort (sinking sort)

2000 Prentice Hall, Inc.

Bubble Sort Example

2000 Prentice Hall, Inc.