Synapseindia - PHP Development Arrays Fuction Part-2

6.
7 Case Study: Computing Mean,

Median and Mode Using Arrays
Mean average
Median number in middle of sorted list
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/* Fig. 6.16: fig06_16.c

2
This program introduces the topic of survey data analysis.
3
It computes the mean, median, and mode of the data */
4#include <stdio.h>
5#define SIZE 99
6
7void mean( const int [] );
8void median( int [] );
9void mode( int [], const int [] ) ;
10 void bubbleSort( int [] );
11 void printArray( const int [] );
12
13 int main()
14 {
15
int frequency[ 10 ] = { 0 };
16
int response[ SIZE ] =
17
{ 6, 7, 8, 9, 8, 7, 8, 9, 8, 9,
18
7, 8, 9, 5, 9, 8, 7, 8, 7, 8,
19
6, 7, 8, 9, 3, 9, 8, 7, 8, 7,
20
7, 8, 9, 8, 9, 8, 9, 7, 8, 9,
21
6, 7, 8, 7, 8, 7, 9, 8, 9, 2,
22
7, 8, 9, 8, 9, 8, 9, 7, 5, 3,
23
5, 6, 7, 2, 5, 3, 9, 4, 6, 4,
24
7, 8, 9, 6, 8, 7, 8, 9, 7, 8,
25
7, 4, 4, 2, 5, 3, 8, 7, 5, 6,
26
4, 5, 6, 1, 6, 5, 7, 8, 7 };
27
28
mean( response );
29
median( response );
30
mode( frequency, response );
31
return 0;
32 }
1. Function
prototypes
1.1 Initialize
array
2. Call
functions
mean,
median,
2
and mode
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
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 );
}
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 ] );
3. Define
function
mean
3.1 Define
function
median
3.1.1 Sort
Array
3
65 }
66
67 void mode( int freq[], const int answer[] )
68 {
69
int rating, j, h, largest = 0, modeValue = 0;
70
71
72
73
74
75
76
printf( "\n%s\n%s\n%s\n",
"********", " Mode", "********" );
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
for ( j = 0; j <= SIZE - 1; j++ )

++freq[ answer[ j ] ];
3.2 Define function

mode
3.2.1 Increase
frequency[]
depending on
response[]
for ( rating = 1; rating <= 9; rating++ )

freq[ rating ] = 0;
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: if elements
113
a[ j ] = a[ j + 1 ];
order, 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" );
3.3 Define
bubbleSor
t
3.3 Define
printArra
out of
y
126
127
128
printf( "%2d", a[ j ] );
}
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
The median is element 49 of

the sorted 99 element array.
For this run the median is 7
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
********
Mode
********
Response
Frequency
Histogram
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.
Program
Output
6.8 Searching Arrays: Linear Search

and Binary Search
Search an array for a key value

Linear search
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
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 5fast; at most n steps, where 2n > number of

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

9
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
10
6.9 Multiple-Subscripted Arrays
Initialization
1
int b[ 2 ][ 2 ] = { { 1, 2 }, { 3, 4 } 3};
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 ] );
11
1/* Fig. 6.22: fig06_22.c

2
Double-subscripted array example */
3#include <stdio.h>
4#define STUDENTS 3
5#define EXAMS 4
6
7int minimum( const int [][ EXAMS ], int, int );
8int maximum( const int [][ EXAMS ], int, int );
9double average( const int [], int );
10 void printArray( const int [][ EXAMS ], int, int );
Each row is a particular student,
11
each column is the grades on the
12 int main()
exam.
13 {
14
int student;
15
const int studentGrades[ STUDENTS ][ EXAMS ] =
16
{ { 77, 68, 86, 73 },
17
{ 96, 87, 89, 78 },
18
{ 70, 90, 86, 81 } };
19
20
printf( "The array is:\n" );
21
printArray( studentGrades, STUDENTS, EXAMS );
22
printf( "\n\nLowest grade: %d\nHighest grade: %d\n",
23
minimum( studentGrades, STUDENTS, EXAMS ),
24
maximum( studentGrades, STUDENTS, EXAMS ) );
25
26
for ( student = 0; student <= STUDENTS - 1; student++ )
27
printf( "The average grade for student %d is %.2f\n",
28
student,
29
average( studentGrades[ student ], EXAMS ) );
30
31
return 0;
32 }
1. Initialize
variables
1.1 Define
functions to
take double
scripted
arrays
1.2 Initialize
12
studentgr
ades[][]
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;
for ( i = 0; i <= pupils - 1; i++ )
for ( j = 0; j <= tests - 1; j++ )
if ( grades[ i ][ j ] < lowGrade )
lowGrade = grades[ i ][ j ];
3. Define
functions
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 )
{
13
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;
for ( i = 0; i <= tests - 1; i++ )
total += setOfGrades[ i ];
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 ] );
}
}
14
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
Lowest grade: 68
Highest grade: 96
The average grade for student 0 is 76.00
Program
Output
15

Synapseindia - PHP Development Arrays Fuction Part-2

Uploaded by

Copyright:

Available Formats

Synapseindia - PHP Development Arrays Fuction Part-2

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Synapseindia - PHP Development Arrays Fuction Part-2

Uploaded by

Copyright:

Available Formats

6.

7 Case Study: Computing Mean,

Mode number that occurs most often

1/* Fig. 6.16: fig06_16.c

void mean( const int answer[] )

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

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

3.2 Define function

for ( rating = 1; rating <= 9; rating++ )

Notice how the subscript in

for ( rating = 1; rating <= 9; rating++ ) {

Print stars depending on value of

The median is element 49 of

6.8 Searching Arrays: Linear Search

Search an array for a key value

6.8 Searching Arrays: Linear Search

For sorted arrays

If equal, match found

Very 5fast; at most n steps, where 2n > number of

30 element array takes at most 5 steps

25 > 30 so at most 5 steps

6.9 Multiple-Subscripted Arrays

Multiple subscripted arrays

Tables with rows and columns (m by n array)

Like matrices: specify row, then column

6.9 Multiple-Subscripted Arrays

Initializers grouped by row in braces

Specify row, then column

1/* Fig. 6.22: fig06_22.c

/* Find the minimum grade */

return ( double ) total / tests;

for ( i = 0; i <= pupils - 1; i++ ) {

The array is:

You might also like