O-1 O-1 CPE 101 slides adapted from UW course Lecture 14: Arrays © 2000 UW CSE O-2 Overview Concepts this lecture Data structures Arrays Subscripts (indices) O-3 Chapter 8 8.1 Declaration and Referencing 8.2 Subscripts 8.3 Loop through arrays 8.4 & 8.5 Arrays arguments and parameters 8.6 Example O-4 Rainfall Data Revisited General task: Read daily rainfall amounts and print some interesting information about them. Input data: Zero or more numbers giving daily rainfall followed by a negative number (sentinel). Example input data: 0.2 0.0 0.0 1.5 0.3 0.0 0.1 -1.0 Empty input sequence: -1.0O-2 O-5 Rainfall Analysis Possible things to report: How many days worth of data are there? How much rain fell on the day with the most rain? On how many days was there no rainfall? What was the average rainfall over the period? On how many days was the rainfall above average? What was the median rainfall? Can we do all of these while we read the data? O-6 Rainfall Analysis (cont) For some tasks (median, number of days above average), we need to have all the data before we can do the analysis. Where do we store the data? Lots of variables (rain1, rain2, rain3, rain4, …)? Awkward Doesn’t scale Need something better O-7 Data Structures Functions give us a way to organize programs. Data structures are needed to organize data, especially: large amounts of data variable amounts of data sets of data where the individual pieces are related to one another In this course, we will structure data using arrays structs combinations of arrays and structs O-8 Arrays Definition: A named, ordered collection of variables of identical type Name the collection (rain); number the elements (0 to 6) Example: rainfall for one week Variable access: rain[0] is 1.0 rain[6] is 0.0 2.0*rain[4] is 2.8 ... 0 6 . . . 1.0 0.2 0.0 0.0 1.4 0.1 0.0 double rain[7]; 1O-3 O-9 Array Terminology type name[size]; double rain[7]; rain is of type array of double with size 7. rain[0], rain[1], ... , rain[6] are the elements of the array rain. Each is a variable of type double. 0,1, ... , 6 are the indices of the array. Also called subscripts. The bounds are the lowest and highest values of the subscripts (here: 0 and 6). array declaration size must be an int constant O-10 Rainfall Analysis (cont.) Strategy for processing data if we need all of it before we can process it: Read data and store it in an array Analyze data stored in the array Key idea: In addition to the array, we need to keep track of how much of the array currently contains valid data. O-11 Keeping Track of Elements In-Use Since an array has to be declared a fixed size, you often declare it bigger than you think you’ll really need #define MAXRAINDAYS 400 int rain[MAXRAINDAYS]; How do you know which elements in the array actually hold data, and which are unused extras? 1. Keep the valid entries together at the front 2. Record number of valid entries in a separate variable O-12 Keep the valid entries together rain 0 MAX RAIN DAYS - 1 6 7 numRainDays 7 for (k=0; k < numRainDays; k++) { /* process rain[k] */ } ! ! ! !O-4 O-13 Print # Days Above Average Algorithm: Read data into an array Compute average rainfall (from array) Count # days above average (from array) Print result O-14 Declarations /* Maximum # of days of input data */ #define MAXRAINDAYS 400 int main(void) { /* rainfall data is stored in */ /* rain[0..numRainDays-1] */ double rain[MAXRAINDAYS]; int numRainDays ; double rainfall; /* current input value */ double rainTotal; /* sum of input rainfall values */ double rainAverage; /* average rainfall */ /* # days with above average rainfall */ int numAbove; int k; O-15 Read Data Into Array /* read and store rainfall data */ printf("Please enter rainfall data.\n"); numRainDays = 0; scanf("%lf", &rainfall); while (rainfall >= 0.0) { rain[numRainDays] = rainfall; numRainDays++; scanf("%lf", &rainfall); } O-16 Calculate Average /* calculate average rainfall */ rainTotal = 0; for (k = 0; k < numRainDays; k++) { rainTotal = rainTotal + rain[k]; } rainAverage = rainTotal / numRainDays; double rain[MAXRAINDAYS]; /* rainfall data*/ int numRainDays; /* # of data values */ double rainTotal; /* sum of input values*/ double rainAverage; /* average rainfall*/ int k; We should make a test to avoid a divide by zeroO-5 O-17 Calculate and Print Answer /* count # of days with rainfall above average */ numAbove = 0; for (k = 0; k < numRainDays; k++) { if (rain[k] > rainAverage) numAbove++; } /* Print the result */ printf("%d days above the average of %.3f.\n", numAbove, rainAverage); double rain[MAXRAINDAYS]; /* rainfall data*/ int numRainDays; /* # of data values */ double rainAverage; /* average rainfall */ int numAbove; /* # of days above average */ int k; O-18 Index Rule Rule: An array index must evaluate to an int between 0 and n-1, where n is the number of elements in the array. No exceptions! Example: rain[i+3+k] /* OK as long as 0 ≤ i+3+k ≤ 6 */ The index may be very simple rain[0] or incredibly complex rain[(int) (3.1 * fabs(sin (2.0*PI*sqrt(29.067))))] O-19 C Array Bounds are Not Checked #define DAYS_IN_WEEK 7 double rain[DAYS_IN_WEEK] ; int index ; index = 900 ; ... rain[index ] = 3.5 ; /* Is index out of range?? */ You need to be sure that the subscript value is in range. Peculiar and unpleasant things can (and probably will) happen if it isn’t. O-20 Technicalities An array is a collection of variables of one type Each element can be used wherever a simple variable of that type is allowed. Assignment, expressions, input/output An entire array can’t be treated as a single variable in C Can’t assign or compare arrays using =, ==, <, … Can’t use scanf or printf to read or write an entire array But, you can do these things one element at a time.O-6 O-21 “Parallel” Arrays A set of arrays may be used in parallel when more than one piece of information must be stored for each item. Example: we are keeping track of a group of students. For each item (student), we might have several pieces of information such as scores O-22 Parallel Arrays Example Suppose we have a midterm grade, final exam grade, and average score for each student. #define MT_WEIGHT 0.30 #define FINAL_WEIGHT 0.70 #define MAX_STUDENTS