CP 09 Arrays1

BITS Pilani
K K Birla Goa Campus
CSF111: Computer Programming
Aggregate data types I: Arrays
Swaroop Joshi
2023
Representing real-world data
✤ So far—
✤ A single number: sqrt(n)
✤ A single character: response = ‘y’
✤ Very few values: max_of_3(n1, n2, n3)

✤ Consider problems like—

✤ So far—


✤ So far—
✤ Compute a cricket team’s total
✤ A single number: sqrt(n) runs given its scorecard (list of
each player’s runs).


✤ So far—
✤ Given a city’s highest
✤ Very few values: max_of_3(n1, n2, n3) temperature record for a month,
display the hottest day.
A possible representation:
Representing real-world data 11 variables for individual runs
12th variable for the total

✤ So far—
A possible representation:
Representing real-world data 11 variables for individual runs
12th variable for the total
Cumbersome!
Error prone!
Dif cult to carry the sense of
abstraction…
✤ So far—
fi

✤ So far—
Most languages
have some runs given its scorecard (list of
way to represent ‘many values
of the same type’
Simplest: arrays!
Array
array | əˈreɪ |
Array noun
an impressive display or range of a particular type of thing:
there is a vast array of literature on the topic
array | əˈreɪ |
Array noun
const int TEAM_SIZE = 11;

int scores[TEAM_SIZE] = {23, 12, 34, 0, 57, 39, 5, 3, 2, 10, 8};
array | əˈreɪ |
Array noun
I need a box big enough to keep
an integer in it and I want to call
it ‘TEAM_SIZE’. Its value is 11
and it cannot be changed.

array | əˈreɪ |
Array noun
11
TEAM_SIZE

array | əˈreɪ |
Array noun
I need an array of TEAM_SIZE
boxes, each big enough to keep
an integer, and I want to call it 11
scores. Each of it should hold the TEAM_SIZE
values given here in the given
order.

array | əˈreɪ |
Array noun
11
TEAM_SIZE
23 12 34 0 57 39 5 3 2 10 8
scores

Array
11
TEAM_SIZE
0 1 2 3 4 5 6 7 8 9 10
23 12 34 0 57 39 5 3 2 10 8
scores

Array
11
TEAM_SIZE
Array indexes 0 1 2 3 4 5 6 7 8 9 10
23 12 34 0 57 39 5 3 2 10 8
scores

Array
11
TEAM_SIZE
Array indexes 0 1 2 3 4 5 6 7 8 9 10
Array values 23 12 34 0 57 39 5 3 2 10 8
scores

Array
11
TEAM_SIZE
Array indexes 0 1 2 3 4 5 6 7 8 9 10
Array values 23 12 34 0 57 39 5 3 2 10 8
scores

printf("%d\n", scores[0]);
Array
11
TEAM_SIZE
Array indexes 0 1 2 3 4 5 6 7 8 9 10
Array values 23 12 34 0 57 39 5 3 2 10 8
scores

Print the value at the 0-th index, or 0
printf("%d\n", scores[1]); steps from the start of the array
Array
11
TEAM_SIZE
Array indexes 0 1 2 3 4 5 6 7 8 9 10
Array values 23 12 34 0 57 39 5 3 2 10 8
scores

Print the value at the 1-st index, or 1
step from the start of the array
Array
11
TEAM_SIZE
Array indexes 0 1 2 3 4 5 6 7 8 9 10
Array values 23 12 34 0 57 39 5 3 2 10 8
scores

printf("%d\n", scores[1]); Print the value at the 10-th index, or

printf("%d\n", scores[10]); 10 steps from the start of the array
Array The rst element in an N-length
array is at index 0
11
TEAM_SIZE
Array indexes 0 1 2 3 4 5 6 7 8 9 10
Array values 23 12 34 0 57 39 5 3 2 10 8
scores

fi
Array
The last element in an N-length array
11 is at index N-1
TEAM_SIZE
Array indexes 0 1 2 3 4 5 6 7 8 9 10
Array values 23 12 34 0 57 39 5 3 2 10 8
scores

Array
11
TEAM_SIZE
Array indexes 0 1 2 3 4 5 6 7 8 9 10
Array values 23 12 34 0 57 39 5 3 2 10 8
scores

Array
HW: what happens if you try
to print scores[k], where
11
k<0 or k≥TEAM_SIZE?
TEAM_SIZE
Array indexes 0 1 2 3 4 5 6 7 8 9 10
Array values 23 12 34 0 57 39 5 3 2 10 8
scores

Compute total score
✤ Accessing each value and

11
making a cumulative sum TEAM_SIZE
✤ How to access each value? 0 1 2 3 4 5 6 7 8 9 10

23 12 34 0 57 39 5 3 2 10 8
scores
Compute total score

11

23 12 34 0 57 39 5 3 2 10 8
scores
int total_score = 0;
int index = 0;
while (index < TEAM_SIZE) {
total_score += scores[index];
++index;
}
printf("Total score: %d\n", total_score);

Compute total score

11

23 12 34 0 57 39 5 3 2 10 8
scores
int index = 0; Identify the initialisation, test,
while (index < TEAM_SIZE) { loop body, and update
++index;
}

Compute total score

11

23 12 34 0 57 39 5 3 2 10 8
scores
int index = 0;
++index; Does this code work as
} expected? Trace it!
Compute total score

11

23 12 34 0 57 39 5 3 2 10 8
scores
int index = 0;
while (index < TEAM_SIZE) { What is the value of index after
++index; the loop? How many times did
} the loop run? How many times
was the test evaluated?
Compute total score

11

23 12 34 0 57 39 5 3 2 10 8
scores
int index = 0;
++index;
}

A for loop
A for loop
✤ Another format of a loop
✤ Preferred when the loop is supposed to go over a

range in equals hops
✤ Accessing each element of an array
✤ Processing all even integers between m and n

A for loop
int index = 0;
while (index < TEAM_SIZE) { ✤ Preferred when the loop is supposed to go over a
total_score += scores[index]; range in equals hops
++index;
}

A for loop
int index = 0;
++index;
}
for (int index = 0; index < TEAM_SIZE; ++index) {

}
Initialisation
A for loop
int index = 0;
++index;
}

}
Initialisation
A for loop
int index = 0;
++index;
}

}
Initialisation
A for loop
int index = 0;
++index;
}

}
Initialisation Test
A for loop
int index = 0;
++index;
}

}
Initialisation Test
A for loop
int index = 0;
++index;
}

}
Initialisation Test
A for loop
int index = 0;
++index;
}

}
Initialisation Test Body
A for loop
int index = 0;
++index;
}

}
A for loop
int index = 0;
++index;
}

}
A for loop
int index = 0;
++index;
}

}
Initialisation Test Body Update
A for loop
int index = 0;
++index;
}

}
A for loop
int index = 0;
++index;
}

}
A for loop
int index = 0;
++index;
}

}
A for loop
int index = 0;
++index;
}

}
A for loop
int index = 0;
++index;
}
Any while loop can be written as a
for loop, and vice versa ✤ Processing all even integers between m and n

}
A for loop
int index = 0;
++index; Any of these four can be empty
} But don’t forget the semicolon in the (..)


}
A for loop
int index = 0;
++index; Any of these four can be empty
} But don’t forget the semicolon in the (..)

for (int index = 0; index < TEAM_SIZE; ++index) { HW: what is the scope of index
}
in the for loop example?
Passing an array to a function
/**
* @brief Computes the sum of elements of the given array of the given length.
* ...
*/
int array_sum(int nums[], int length) {
int answer = 0;
for (int index = 0; index < length; ++index)
answer += nums[index];
return answer;
}
int main() {
printf("Total score: %d\n", array_sum(scores, TEAM_SIZE));
return 0;
}
/**
* ...
*/ A general function that can be used
int answer = 0; in several examples
return answer;
}
int main() {
return 0;
}
/**
* ...
*/
int answer = 0;
return answer; It needs to know the length of the array;

} don’t forget to pass it to the function
int main() {
return 0;
}
/**
* ...
*/
int answer = 0;
return answer;
}
int main() {
return 0;
}
Your turn
✤ Write a function to nd the

largest element in a
nonempty array of integers
fi
Your turn
Data An array and its length

fi
Your turn

Contract, Finds the largest element in the
Purpose, and given array
Header int largest(int nums[], int n)
fi
Your turn

1 largest([1], 1)
Examples 2 largest([2, 1], 2)
nonempty array of integers …
fi
Your turn

1 largest([1], 1)
Examples 2 largest([2, 1], 2)
nonempty array of integers …
Body // ???
fi
Your turn

mean of a nonempty array of
real numbers
fi
Your turn

real numbers
fi
Your turn

Contract,
Finds the mean of the given array.
Purpose,
double mean(double nums[], int n)
and Header
real numbers
fi
Your turn

Contract,
Purpose,
and Header
1 mean([1], 1)
Examples 1.5 mean([2, 1], 2)
real numbers …
fi
Your turn

Contract,
Purpose,
and Header
1 mean([1], 1)
Examples 1.5 mean([2, 1], 2)
real numbers …
Body // ???
fi

CP 09 Arrays1

Uploaded by

Document Information

Original Title

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

CP 09 Arrays1

Uploaded by

Copyright:

Available Formats

BITS Pilani

K K Birla Goa Campus

CSF111: Computer Programming

Aggregate data types I: Arrays

✤ A single number: sqrt(n)

✤ A single character: response = ‘y’

✤ Very few values: max_of_3(n1, n2, n3)

✤ Consider problems like—

✤ A single number: sqrt(n)

✤ A single character: response = ‘y’

✤ Very few values: max_of_3(n1, n2, n3)

✤ Consider problems like—

✤ Very few values: max_of_3(n1, n2, n3)

✤ Consider problems like—

✤ Consider problems like—

✤ Consider problems like—

const int TEAM_SIZE = 11;

const int TEAM_SIZE = 11;

const int TEAM_SIZE = 11;

const int TEAM_SIZE = 11;

const int TEAM_SIZE = 11;

const int TEAM_SIZE = 11;

const int TEAM_SIZE = 11;

const int TEAM_SIZE = 11;

const int TEAM_SIZE = 11;

const int TEAM_SIZE = 11;

const int TEAM_SIZE = 11;

const int TEAM_SIZE = 11;

printf("%d\n", scores[1]); Print the value at the 10-th index, or

const int TEAM_SIZE = 11;

const int TEAM_SIZE = 11;

const int TEAM_SIZE = 11;

const int TEAM_SIZE = 11;

✤ Accessing each value and

✤ How to access each value? 0 1 2 3 4 5 6 7 8 9 10

✤ Accessing each value and

✤ How to access each value? 0 1 2 3 4 5 6 7 8 9 10

printf("Total score: %d\n", total_score);

✤ Accessing each value and

✤ How to access each value? 0 1 2 3 4 5 6 7 8 9 10

printf("Total score: %d\n", total_score);

✤ Accessing each value and

✤ How to access each value? 0 1 2 3 4 5 6 7 8 9 10

✤ Accessing each value and

✤ How to access each value? 0 1 2 3 4 5 6 7 8 9 10

✤ Accessing each value and

✤ How to access each value? 0 1 2 3 4 5 6 7 8 9 10

printf("Total score: %d\n", total_score);

✤ Preferred when the loop is supposed to go over a

✤ Accessing each element of an array

✤ Processing all even integers between m and n

✤ Processing all even integers between m and n

✤ Processing all even integers between m and n

for (int index = 0; index < TEAM_SIZE; ++index) {

✤ Processing all even integers between m and n

for (int index = 0; index < TEAM_SIZE; ++index) {

✤ Processing all even integers between m and n

for (int index = 0; index < TEAM_SIZE; ++index) {

✤ Processing all even integers between m and n

for (int index = 0; index < TEAM_SIZE; ++index) {

✤ Processing all even integers between m and n

for (int index = 0; index < TEAM_SIZE; ++index) {

✤ Processing all even integers between m and n