Basic Array Definition Subscripts are 0 through 99

Basic Array Definition // Subscripts are 0 through 99

Example Definitions • Suppose – – const int N = 20; const int M = 40; const int Max. String. Size = 80; const int Max. List. Size = 1000; • Then the following are all correct array definitions – – – int A[10]; // array of 10 ints char B[Max. String. Size]; // array of 80 chars double C[M*N]; // array of 800 floats int Values[Max. List. Size]; // array of 1000 ints Rational D[N-15]; // array of 5 Rationals

Subscripting • Suppose – int A[10]; // array of 10 ints A[0], … A[9] • To access individual element must apply a subscript to list name A – A subscript is a bracketed expression also known as the index – First element of list has index 0 – A[0] – Second element of list has index 1, and so on – A[1] – Last element has an index one less than the size of the list – A[9] – Incorrect indexing is a common error – A[10] // does not exist

Array Elements • Suppose int A[10]; // array of 10 uninitialized ints • To access an individual element we must apply a subscript to list name A

Array Element Manipulation Consider int i = 7, j = 2, k = 4; A[0] = 1;

Array Element Manipulation Consider int i = 7, j = 2, k = 4; A[0] = 1; A[i] = 5;

Array Element Manipulation Consider int i = 7, j = 2, k = 4; A[0] = 1; A[i] = 5; A[j] = A[i] + 3;

Array Element Manipulation Consider int i = 7, j = 2, k = 4; A[0] = 1; A[i] = 5; A[j] = A[i] + 3; A[j+1] = A[i] + A[0];

Array Element Manipulation Consider int i = 7, j = 2, k = 4; A[0] = 1; A[i] = 5; A[j] = A[i] + 3; A[j+1] = A[i] + A[0]; A[A[j]] = 12;

Array Element Manipulation Consider int i = 7, j = 2, k = 4; A[0] = 1; A[i] = 5; A[j] = A[i] + 3; A[j+1] = A[i] + A[0]; A[A[j]] = 12; cin >> A[k]; // where next input value is 3

Array Initialization During Declaration suppose int x[10] = {8, 5, 4} x = {8, 5, 4, 0, 0, 0, 0} suppose int y[10] = {0} y = {0, 0, 0, 0}

Array Element Manipulation For loop is the typical construct to be used for array element manipulation Declare and initializes a double type array of ten elements with 10. 0 stored at each index/location of the array, use for loop for initialization double arr 1[10]; for (int index= 0; index<10; index++) arr 1[index] = 10. 0;

Array As an Entity • Suppose int x[10]; int y[10]; y = x; illegal cin>>x; cout<<y illegal if (x<=y). . . illegal

Array Element Input/Output To fill an array from user’s input double arr 1[10]; for (int index= 0; index<10; index++) cin>>arr 1[index]; To output an array onto the screen for (int index= 0; index<10; index++) cout<<arr 1[index] <<“ “;

Array Element Manipulation Write down a code that declares two double type arrays of 10 elements each, it gets them initialized from the user and finally decides and prints whether the arrays are equal or not.

Array Element Manipulation double arr 1[10]; double arr 2[10]; for (int index= 0; index<10; index++) { cin>>arr 1[index]; cin>>arr 2[index]; } for (int index= 0; index<10; index++) if (arr 1[index] != arr 2[index]. . .

Printing in reverse order using arrays How to print an array in the reverse order

Printing in reverse order using arrays int main() { int item[5]= {5, 6, 7, 8, 9}; //Declare an array item of five //components for (counter = 4; counter >= 0; counter--) cout << item[counter] << " "; cout << endl; return 0; }

How to check whether an Array is sorted Write down a code that checks whether an array (named arr 2 of 10 ints, already initialized) is already sorted in ascending order or not.

How to check whether an Array is sorted int arr 2[10]; …//array initialized bool sorted = true; for (int index=0; index<9; index++) { if (arr 2[index + 1]<arr 2[index]) {sorted = false; break; } }

(Generic and complete code) const int size = 5; int arr 2[size]= {1, 2, 3, 4, 5}; bool sorted = true; for (int index=0; index<size-1; index++) { if (arr 2[index +1]<arr 2[index]) {sorted = false; break; } }

(Generic and complete code) if (sorted==true) cout<< "sorted"; else cout<< "unsorted";

Max of an array Write down a code that finds out the element having maximum value within the array, the code finds out the location of the max as well. How to start?

Max of an array const int list. Size= 100; int list[list. Size]; int index; for (index = 0; index < list. Size; index++) cin>>list[index]; int max. Index = 0; //Assume the first element is the largest for (index = 1; index < list. Size; index++) if (list[max. Index] < list[index]) max. Index = index; cout<<list[max. Index]<<“ “<< max. Index;

Sorting of Arrays Bubble Sort (Ascending order) Compare the first element with the second one, swap if second is smaller Do the same process with element 2 and 3, and so on, till the end of the array (Name this process as a “Pass”) Choose the worst case that is an array already sorted in descending order to find out the number of passes Choose the following array to apply the above algorithm {9, 8, 7, 5, 4, 3, 2, 1} Find out the number of comparisons/pass and no. of passses

Sorting of arrays 9 8 6 4

Sorting of arrays 8 9 6 4

Sorting of arrays 8 6 9 4

Sorting of arrays 8 6 One “Pass” completed 4 9

Sorting of arrays 8 6 4 9

Sorting of arrays 6 8 4 9

Sorting of arrays 6 4 8 9

Sorting of arrays 6 4 2 nd “Pass” completed 8 9

Sorting of arrays 6 4 8 9

Sorting of arrays 4 6 8 9

Sorting of arrays 4 6 8 9

Sorting of arrays 4 6 3 rd “Pass” completed. Sorting completed. 8 9

Sorting (Bubble Sort) int main() { const int array. Size = 10; int a[ array. Size ] = { 2, 6, 4, 8, 10, 12, 89, 68, 45, 37 }; int hold; // temporary variable // bubble sort // loop to control number of passes for ( int pass = 0; pass < array. Size - 1; pass++ ) // loop to control number of comparisons per pass for ( int j = 0; j < array. Size - 1; j++ )

Sorting (Bubble Sort) // compare side-by-side elements and swap them if // first element is greater than second element if ( a[ j ] > a[ j + 1 ] ) { hold = a[ j ]; a[ j ] = a[ j + 1 ]; a[ j + 1 ] = hold; } // end if return 0; } // end main

Base Address of a Function int main() { int my. List[5] = {0, 2, 4, 6, 8}; int your. List[5]; cout << "Line 3: Base address of my. List: " << my. List << endl; return 0; }

Base Address of a Function A sample run of this program is: // Line 3: Base address of my. List: 0012 FEC 4 This is hexadecimal representation of the binary number 000000100101111111011000100 The decimal representation of this number is 1, 244, 868

Passing Arrays to Functions Passed by reference only The symbol & not used Normally size of the array also passed as another int type variable Functions cannot return a value of type array

Passing Arrays to Functions const int ARRAY_SIZE = 10; void fill. Array(int list[], int list. Size) { int index; void fill. Array(int x[], int size. X); int main() { int list. A[ARRAY_SIZE] = {0}; fill. Array(list. A, ARRAY_SIZE); return 0; } for (index = 0; index < list. Size; index++) cin >> list[index]; }

Passing Arrays to Functions We can prevent an array from being changed by the function being called by using the reserve word “const”

Passing Arrays to Functions const int ARRAY_SIZE = 10; int sum. Array(const int x[], int size. X); void fill. Array(int x[], int size. X); void copy. Array(const int x[], int y[], int length); int main() { int list. A[ARRAY_SIZE] = {0}; int list. B[ARRAY_SIZE]; fill. Array(list. A, ARRAY_SIZE); cout << sum. Array(list. A, ARRAY_SIZE) << endl; copy. Array(list. A, list. B, ARRAY_SIZE); return 0; }

Passing Arrays to Functions int sum. Array(const int list[], int list. Size) { int index; int sum = 0; for (index = 0; index < list. Size; index++) sum = sum + list[index]; return sum; } void copy. Array(const int list. One[], int list. Two[], int list. One. Size) { int index; for (index = 0; index < list. One. Size; index++) list. Two[index] = list. One[index]; }

Character Arrays Character Array: An array of Characters n Can be declared by user n Its size is determined by the user’s statement n E. g. char name[5]= {‘A’, ‘l’, ‘i’} n char name[5]=“Ali” n char name[]=“Ali”

C Strings A predefined data type in C++, that is similar to character arrays, but has the following differences Size of strings is automatic A string always terminates at null character (‘’) We shall use the concept of character arrays and strings interchangeably therefore we redefine the previous examples as follows char name[5]= {‘A’, ‘l’, ‘i’, ‘’} char name[5]=“Ali” char name[]=“Ali” Now we can treat them as strings

Length of the character array Write down a code segment that finds out and displays the length (excluding the null character), of a character array is obviously null terminated and defined and initialized somewhere else in the code. int len =0; while (arr 1[len] != '') { len++; }

Question Write down a code segment that finds the smallest number present in five different int arrays. The arrays are already initialized and have the names n arr 1 having arr. Size 1 n arr 2 having arr. Size 2 and so on n Last array is arr 5 having arr. Size 5 Use a general function smallest. Number to find the smallest within an array. You can use this function repeatedly to solve the problem. You can use a temporary array having size equal to 5, if required. Do not declare or initialize the actual five arrays, they are already declared and initialized.

Two dimensional arrays A collection of fixed number of components arranged in rows and columns data. Type array. Name[int rows][int cols] For example double sales[10][5]

Two dimensional arrays [0][0] [0][1] [1][0] … [0][2] [0][3] [0][4] [9][4]

Two dimensional arrays (Initialization) const int NUMBER_OF_ROWS = 6; const int NUMBER_OF_COLUMNS = 5; int board[NUMBER_OF_ROWS][NUMBER_OF_COLUMNS] = {0}; 0 0 0 0 0 0 0 0

Two dimensional arrays (Initialization) const int NUMBER_OF_ROWS = 6; const int NUMBER_OF_COLUMNS = 5; int board[NUMBER_OF_ROWS][NUMBER_OF_COLUMNS] = {{23, 5}, {4, 16, 24, 67, 10}, {12, 54, 23, 76, 11}, {1, 12, 34, 22, 8}, {81, 54, 32, 67, 33}, };

Two dimensional arrays (Initialization) 23 4 12 1 81 0 5 0 0 0 16 24 67 10 54 23 76 11 12 34 22 8 54 32 67 33 0 0

Two dimensional arrays (Printing) Write down code to print the above mentioned two dimensional array if a difference of 5 spaces is to be printed between two adjacent row elements. int row, col; for (row = 0; row < NUMBER_OF_ROWS; row++) { for (col = 0; col < NUMBER_OF_COLUMNS; col++) cout << setw(5) << board[row][col] << " "; cout << endl; }

Two dimensional arrays (Printing) Write down code to print the above mentioned two dimensional array into a file. int row, col; ofstream o; o. open("d: \twod. ARR 2. txt"); for (row = 0; row < NUMBER_OF_ROWS; row++) { for (col = 0; col < NUMBER_OF_COLUMNS; col++) o << setw(5) << matrix[row][col] << " "; o << endl; }

Two dimensional arrays int row, col; int X; for (row = 0; row < NUMBER_OF_ROWS; row++) { X = 0; for (col = 0; col < NUMBER_OF_COLUMNS; col++) X = X + matrix[row][col]; cout << X<< endl; } Sum of each individual row

Two dimensional arrays int row, col; int x; for (row = 0; row < NUMBER_OF_ROWS; row++) { x = matrix[row][0]; for (col = 1; col < NUMBER_OF_COLUMNS; col++) if (x < matrix[row][col]) x = matrix[row][col]; cout << x << endl; } Largest element in each row

Two dimensional arrays (diagonal reversing algo ) 1 0 0 2 0 0 3 0 0 4

Two dimensional arrays (diagonal reversing algo ) 4 0 0 2 0 0 3 0 0 1

Two dimensional arrays (diagonal reversing algo ) 4 0 0 3 0 0 2 0 0 1

Two dimensional arrays (diagonal reversing algo ) for (row=0; row<ROWS/2; row++){ temp = matrix[row]; matrix[row] = matrix[ROWS-1 -row]; matrix[ROWS-1 -row] = temp; }

Passing Two D Arrays to Functions C++ stores a 2 d array as if it is a collection of 1 d arrays placed row wise with in the memory Therefore the function call must have the number of columns within it e. g. Consider the following function definition void funone(int table[][5], int row. Size) i. e A two d array having 5 columns is accepted as a parameter. Row size comes as a separate parameter.

Passing Two D Arrays to Functions const int ROWS = 6; const int COLUMNS = 5; void print. Matrix(int matrix[][COLUMNS], int ROWS); void sum. Rows(int matrix[][COLUMNS], int ROWS); void largest. In. Rows(int matrix[][COLUMNS], int ROWS); int main() { int board[ROWS][COLUMNS] = {. . . }; print. Matrix(board, ROWS); sum. Rows(board, ROWS);

Passing Two D Arrays to Functions void sum. Rows(int matrix[][COLUMNS], int no. Of. Rows) { int row, col; int sum; for (row = 0; row < no. Of. Rows; row++) { sum = 0; for (col = 0; col < COLUMNS; col++) sum = sum + matrix[row][col]; cout << "Sum of row " << (row + 1) << " = " << sum<< endl;