Microsoft PowerPoint - CS480_Wk05_Ch07_MultiDimArrays

Liang, Introduction to Java Programming, Ninth Edition, (c) 2013 Pearson Education, Inc. All

rights reserved. 42

Announcements

• Homework #4 will be posted today• The homework is due next week

• There is a quiz next week!• Materials from weeks 3, 4, and 5 lectures

• Opened books and notes

• No electronic devices – cell phone, laptop, etc.


rights reserved. 43

Copying ArraysOften, in a program, you need to duplicate an array or a part of an array. In such cases you could attempt to use the assignment statement (=), as follows: list2 = list1;


rights reserved. 44

Copying Arrays

Using a loop:

int[] sourceArray = {2, 3, 1, 5, 10};

int[] targetArray = new

int[sourceArray.length];

for (int i = 0; i < sourceArrays.length; i++)

targetArray[i] = sourceArray[i];


rights reserved. 45

The arraycopy Utility

arraycopy(sourceArray, src_pos,

targetArray, tar_pos, length);

Example:

System.arraycopy(sourceArray, 0,

targetArray, 0, sourceArray.length);


rights reserved. 46

Passing Arrays to Methods

public static void printArray(int[] array) {

for (int i = 0; i < array.length; i++) {

System.out.print(array[i] + " ");

}

}

Invoke the method

int[] list = {3, 1, 2, 6, 4, 2};

printArray(list);

Invoke the method

printArray(new int[]{3, 1, 2, 6, 4, 2});

Anonymous array


rights reserved. 47

Anonymous ArrayThe statement

printArray(new int[]{3, 1, 2, 6, 4, 2});

creates an array using the following syntax:

new dataType[]{literal0, literal1, ..., literalk};

There is no explicit reference variable for the array. Such

array is called an anonymous array.


rights reserved. 48

Pass By ValueJava uses pass by value to pass arguments to a method. There are important differences between passing a value of variables of primitive data types and passing arrays.

• For a parameter of a primitive type value, the actual value is passed.

• Changing the value of the local parameter inside the method does not affect the value of the variable outside the method.

• For a parameter of an array type, the value of the parameter contains a reference to an array; this reference is passed to the method.

• Any changes to the array that occur inside the method body will affect the original array that was passed as the argument.


rights reserved. 49

public class Test {

public static void main(String[] args) {

int x = 1; // x represents an int value

int[] y = new int[10]; // y represents an array of int values

m(x, y); // Invoke m with arguments x and y

System.out.println("x is " + x);

System.out.println("y[0] is " + y[0]);

}

public static void m(int number, int[] numbers) {

number = 1001; // Assign a new value to number

numbers[0] = 5555; // Assign a new value to numbers[0]

}

}

Simple Example


rights reserved. 50

Call Stack

When invoking m(x, y), the values of x and y are

passed to number and numbers. Since y contains the

reference value to the array, numbers now contains the

same reference value to the same array.


rights reserved. 51

Call Stack

When invoking m(x, y), the values of x and y are

passed to number and numbers. Since y contains the

reference value to the array, numbers now contains

the same reference value to the same array.


rights reserved. 52

Heap

The JVM stores the array in an area of memory,

called heap, which is used for dynamic memory

allocation where blocks of memory are allocated

and freed in an arbitrary order.


rights reserved. 53

Passing Arrays as Arguments

Objective: Demonstrate differences of passing

primitive data type variables and array variables.

TestPassArray Run


rights reserved. 54

Example, cont.


rights reserved. 55

Returning an Array from a Methodpublic static int[] reverse(int[] list) {

int[] result = new int[list.length];

for (int i = 0, j = result.length - 1;

i < list.length; i++, j--) {

result[j] = list[i];

}

return result;}

int[] list1 = {1, 2, 3, 4, 5, 6};

int[] list2 = reverse(list1);

list

result


rights reserved. 56

Trace the reverse Method

public static int[] reverse(int[] list) {





}

return result;}

int[] list1 = {1, 2, 3, 4, 5, 6};


list

result

1 2 3 4 5 6

0 0 0 0 0 0

Declare result and create array


rights reserved. 57

Trace the reverse Method, cont.






}

return result;}

int[] list1 = {1, 2, 3, 4, 5, 6};


list

result

1 2 3 4 5 6

0 0 0 0 0 0

i = 0 and j = 5


rights reserved. 58







}

return result;}

int[] list1 = {1, 2, 3, 4, 5, 6};


list

result

1 2 3 4 5 6

0 0 0 0 0 0

i (= 0) is less than 6


rights reserved. 59







}

return result;}

int[] list1 = {1, 2, 3, 4, 5, 6};


list

result

1 2 3 4 5 6

0 0 0 0 0 1

i = 0 and j = 5

Assign list[0] to result[5]


rights reserved. 60







}

return result;}

int[] list1 = {1, 2, 3, 4, 5, 6};


list

result

1 2 3 4 5 6

0 0 0 0 0 1

After this, i becomes 1 and j

becomes 4


rights reserved. 61







}

return result;}

int[] list1 = {1, 2, 3, 4, 5, 6};


list

result

1 2 3 4 5 6

0 0 0 0 0 1

i (=1) is less than 6


rights reserved. 62







}

return result;}

int[] list1 = {1, 2, 3, 4, 5, 6};


list

result

1 2 3 4 5 6

0 0 0 0 2 1

i = 1 and j = 4

Assign list[1] to result[4]


rights reserved. 63







}

return result;}

int[] list1 = {1, 2, 3, 4, 5, 6};


list

result

1 2 3 4 5 6

0 0 0 0 2 1

After this, i becomes 2 and

j becomes 3


rights reserved. 64







}

return result;}

int[] list1 = {1, 2, 3, 4, 5, 6};


list

result

1 2 3 4 5 6

0 0 0 0 2 1

i (=2) is still less than 6


rights reserved. 65







}

return result;}

int[] list1 = {1, 2, 3, 4, 5, 6};


list

result

1 2 3 4 5 6

0 0 0 3 2 1

i = 2 and j = 3

Assign list[i] to result[j]


rights reserved. 66







}

return result;}

int[] list1 = {1, 2, 3, 4, 5, 6};


list

result

1 2 3 4 5 6

0 0 0 3 2 1


j becomes 2


rights reserved. 67







}

return result;}

int[] list1 = {1, 2, 3, 4, 5, 6};


list

result

1 2 3 4 5 6

0 0 0 3 2 1



rights reserved. 68







}

return result;}

int[] list1 = {1, 2, 3, 4, 5, 6};


list

result

1 2 3 4 5 6

0 0 4 3 2 1

i = 3 and j = 2



rights reserved. 69







}

return result;}

int[] list1 = {1, 2, 3, 4, 5, 6};


list

result

1 2 3 4 5 6

0 0 4 3 2 1


j becomes 1


rights reserved. 70







}

return result;}

int[] list1 = {1, 2, 3, 4, 5, 6};


list

result

1 2 3 4 5 6

0 0 4 3 2 1



rights reserved. 71







}

return result;}

int[] list1 = {1, 2, 3, 4, 5, 6};


list

result

1 2 3 4 5 6

0 5 4 3 2 1

i = 4 and j = 1



rights reserved. 72







}

return result;}

int[] list1 = {1, 2, 3, 4, 5, 6};


list

result

1 2 3 4 5 6

0 5 4 3 2 1


j becomes 0


rights reserved. 73







}

return result;}

int[] list1 = {1, 2, 3, 4, 5, 6};


list

result

1 2 3 4 5 6

0 5 4 3 2 1



rights reserved. 74







}

return result;}

int[] list1 = {1, 2, 3, 4, 5, 6};


list

result

1 2 3 4 5 6

6 5 4 3 2 1

i = 5 and j = 0



rights reserved. 75







}

return result;}

int[] list1 = {1, 2, 3, 4, 5, 6};


list

result

1 2 3 4 5 6

6 5 4 3 2 1


j becomes -1


rights reserved. 76







}

return result;}

int[] list1 = {1, 2, 3, 4, 5, 6};


list

result

1 2 3 4 5 6

6 5 4 3 2 1

i (=6) < 6 is false. So exit

the loop.


rights reserved. 77







}

return result;}

int[] list1 = {1, 2, 3, 4, 5, 6};


list

result

1 2 3 4 5 6

6 5 4 3 2 1

Return result

list2


rights reserved. 79

Searching Arrays

• Searching is the process of looking for a specific element in an array; for example, discovering whether a certain score is included in a list of scores.

• In this section, two commonly used approaches are discussed, linear search and binary search.


rights reserved. 80

Linear Search

The linear search approach:

• The method compares the key element, key,

sequentiallywith each element in the array list.

• It continues to do so until the key matches an

element in the list or the list is exhausted without a

match being found.

• If a match is made, the linear search returns the index of

the element in the array that matches the key.

• If no match is found, the search returns -1.


rights reserved. 81

Linear Search Animation

6 4 1 9 7 3 2 8

6 4 1 9 7 3 2 8

6 4 1 9 7 3 2 8

6 4 1 9 7 3 2 8

6 4 1 9 7 3 2 8

6 4 1 9 7 3 2 8

3

3

3

3

3

3

animation

Key List


rights reserved. 83

From Idea to Solution/** The method for finding a key in the list */

public static int linearSearch(int[] list, int key) {

for (int i = 0; i < list.length; i++)

if (key == list[i])

return i;

return -1;

}

int[] list = {1, 4, 4, 2, 5, -3, 6, 2};

int i = linearSearch(list, 4); // returns 1

int j = linearSearch(list, -4); // returns -1

int k = linearSearch(list, -3); // returns 5

Trace the method


rights reserved. 93

Sorting Arrays

• Sorting, like searching, is also a common task in

computer programming.

• This section introduces two simple, intuitive

sorting algorithms: selection sort and insertion

sort.


rights reserved. 94

Selection sort finds the smallest number in the list and places it first. It then finds the smallest number remaining and places it second, and so on until the list contains only a single number.

Selection Sort


rights reserved. 96

From Idea to Solutionfor (int i = 0; i < list.length; i++)

{

select the smallest element in list[i..listSize-1];

swap the smallest with list[i], if necessary;

// list[i] is in its correct position.

// The next iteration apply on list[i..listSize-1]

}

list[0] list[1] list[2] list[3] ... list[10]





...



rights reserved. 97

Expand

for (int i = 0; i < listSize; i++)

{





}

double currentMin = list[i];

int currentMinIndex = i;

for (int j = i+1; j < list.length; j++) {

if (currentMin > list[j]) {

currentMin = list[j];

currentMinIndex = j;

}

}


rights reserved. 98

Expand


{





}



for (int j = i; j < list.length; j++) {




}

}


rights reserved. 99

Expand


{





}

if (currentMinIndex != i) {

list[currentMinIndex] = list[i];

list[i] = currentMin;

}


rights reserved. 100

Wrap it in a Method/** The method for sorting the numbers */

public static void selectionSort(double[] list) {

for (int i = 0; i < list.length; i++) {

// Find the minimum in the list[i..list.length-1]



for (int j = i + 1; j < list.length; j++) {




}

}

// Swap list[i] with list[currentMinIndex] if necessary;

if (currentMinIndex != i) {

list[currentMinIndex] = list[i];

list[i] = currentMin;

}

}

}

Invoke it

selectionSort(yourList)



Insertion Sortint[] myList = {2, 9, 5, 4, 8, 1, 6}; // Unsorted

The insertion sort algorithm sorts a list of values by repeatedly inserting an unsorted element into a sorted sublist until the whole list is sorted.



Insertion Sort

2 9 5 4 8 1 62 9 5 4 8 1 6

2 5 9 4 8 1 6

2 4 5 8 9 1 6

1 2 4 5 8 9 6

2 4 5 9 8 1 6

1 2 4 5 6 8 9

int[] myList = {2, 9, 5, 4, 8, 1, 6}; // Unsorted

animation



How to Insert?The insertion sort algorithm sorts a list of values by repeatedly inserting an unsorted element into a sorted sublist until the whole list is sorted.



From Idea to Solutionfor (int i = 1; i < list.length; i++) {

insert list[i] into a sorted sublist list[0..i-1] so that

list[0..i] is sorted

}

list[0]

list[0] list[1]

list[0] list[1] list[2]

list[0] list[1] list[2] list[3]

list[0] list[1] list[2] list[3] ...



From Idea to Solutionfor (int i = 1; i < list.length; i++) {

insert list[i] into a sorted sublist list[0..i-1] so that

list[0..i] is sorted

}

InsertionSort

Expand

double currentElement = list[i];

int k;

for (k = i - 1; k >= 0 && list[k] > currentElement; k--) {

list[k + 1] = list[k];

}

// Insert the current element into list[k + 1]

list[k + 1] = currentElement;



The Arrays.sort Method

Since sorting is frequently used in programming, Java provides several overloaded sort methods for sorting an array of int, double, char, short, long, and float in the java.util.Arrays class. For example, the following code sorts an array of numbers and an array of characters.

double[] numbers = {6.0, 4.4, 1.9, 2.9, 3.4, 3.5};

java.util.Arrays.sort(numbers);

char[] chars = {'a', 'A', '4', 'F', 'D', 'P'};

java.util.Arrays.sort(chars);


rights reserved. 1

CHAPTER 7

Multi-Dimensional Arrays


rights reserved. 2

MotivationsThus far, you have used one-dimensional arrays to model linear collections of elements. You can use a two-dimensional array to represent a matrix or a table. For example, the following table that describes the distances between the cities can be represented using a two-dimensional array.


rights reserved. 3

Declare/Create Two-Dimensional Arrays

// Declare array ref var

dataType[][] refVar;

// Create array and assign its reference to variable

refVar = new dataType[10][10];

// Combine declaration and creation in one statement

dataType[][] refVar = new dataType[10][10];

// Alternative syntax

dataType refVar[][] = new dataType[10][10];


rights reserved. 4

Declaring Variables of Two-Dimensional

Arrays and Creating Two-dimensional Arrays

int[][] matrix = new int[10][10];

orint matrix[][] = new int[10][10];

matrix[0][0] = 3;

for (int i = 0; i < matrix.length; i++)

for (int j = 0; j < matrix[i].length; j++)matrix[i][j] = (int)(Math.random() * 1000);


rights reserved. 5

Two-dimensional Array Illustration

array.length? 4

array[0].length? 3

matrix.length? 5

matrix[0].length? 5


rights reserved. 6

Declaring, Creating, and Initializing Using

Shorthand Notations

You can also use an array initializer to declare, create and

initialize a two-dimensional array. For example,

int[][] array = new int[4][3];

array[0][0] = 1; array[0][1] = 2; array[0][2] = 3;




int[][] array = {

{1, 2, 3},

{4, 5, 6},

{7, 8, 9},

{10, 11, 12}

};

Same as


rights reserved. 7

Lengths of Two-dimensional Arraysint[][] x = new int[3][4];


rights reserved. 8

Lengths of Two-dimensional

Arrays, cont.

int[][] array = {

{1, 2, 3},

{4, 5, 6},

{7, 8, 9},

{10, 11, 12}

};

array.length

array[0].length

array[1].length

array[2].length

array[3].length

array[4].length

ArrayIndexOutOfBoundsException


rights reserved. 9

Ragged Arrays

Each row in a two-dimensional array is itself an array.

So, the rows can have different lengths. Such an array is

known as a ragged array. For example,

int[][] matrix = {

{1, 2, 3, 4, 5},

{2, 3, 4, 5},

{3, 4, 5},

{4, 5},

{5}

};

matrix.length is 5

matrix[0].length is 5






rights reserved. 10

Ragged Arrays, cont.


rights reserved. 11

Processing Two-Dimensional Arrays

See the examples in the text.

1. (Initializing arrays with input values)

2. (Printing arrays)

3. (Summing all elements)

4. (Summing all elements by column)

5. (Which row has the largest sum)

6. (Finding the smallest index of the largest element)

7. (Random shuffling)


rights reserved. 12

Initializing arrays with input values

java.util.Scanner input = new Scanner(System.in);

System.out.println("Enter " + matrix.length + " rows and " + matrix[0].length + " columns: ");

for (int row = 0; row < matrix.length; row++) {

for (int column = 0; column < matrix[row].length; column++) {

matrix[row][column] = input.nextInt();

}

}


rights reserved. 13

Printing arrays



System.out.print(matrix[row][column] + " ");

}

System.out.println();

}


rights reserved. 14

Summing all elements

int total = 0;



total += matrix[row][column];

}

}


rights reserved. 15

Summing elements by column

for (int column = 0; column < matrix[0].length; column++) {

int total = 0;

for (int row = 0; row < matrix.length; row++)

total += matrix[row][column];

System.out.println("Sum for column " + column + " is "

+ total);

}


rights reserved. 18

Problem: Grading Multiple-

Choice Test

Objective: write a

program that grades

multiple-choice test.

GradeExamRun

Microsoft PowerPoint - CS480_Wk05_Ch07_MultiDimArrays

Documents

Transcript of Microsoft PowerPoint - CS480_Wk05_Ch07_MultiDimArrays