Chapter 7: Arrays and Array Lists. To become familiar with using arrays and array lists To learn about wrapper classes, auto-boxing and the generalized.

Slides:



Advertisements
Similar presentations
Arrays and ArrayLists Ananda Gunawardena. Introduction Array is a useful and powerful aggregate data structure presence in modern programming languages.
Advertisements

Big Java by Cay Horstmann Copyright © 2008 by John Wiley & Sons. All rights reserved. It is common to use two nested loops when filling or searching: for.
Week 10 Introduction to Computer Science and Object-Oriented Programming COMP 111 George Basham.
Big Java by Cay Horstmann Copyright © 2008 by John Wiley & Sons. All rights reserved. Chapter Seven: Arrays and Array Lists.
Chapter 13 ARRAY LISTS AND ARRAYS. CHAPTER GOALS To become familiar with using array lists to collect objects To learn about common array algorithms To.
Chapter 7 Arrays and Array Lists. Chapter Goals To become familiar with using arrays and array lists To learn about wrapper classes, auto-boxing and the.
Chapter 13 ARRAY LISTS AND ARRAYS CHAPTER GOALS –To become familiar with using array lists to collect objects –To learn about common array algorithms –To.
Big Java by Cay Horstmann Copyright © 2009 by John Wiley & Sons. All rights reserved. Chapter 17 – Generic Programming.
Our BankAccount class should define three methods  deposit  withdraw  getBalance How a programmer will carry out these operations?  We assume that.
Big Java by Cay Horstmann Copyright © 2009 by John Wiley & Sons. All rights reserved. Chapter Three - Implementing Classes.
Arrays.
Chapter 7 – Arrays.
Computer Science A 10: 20/3. Array Array: Sequence of values of the same type Construct array: new double[10] Store in variable of type double[] double[]
Chapter 7  Arrays and Array Lists 1 Chapter 7 Arrays and Array Lists.
Datalogi A 8: 27/10. Array Array: Sequence of values of the same type Construct array: new double[10] Store in variable of type double[] double[] data.
© The McGraw-Hill Companies, 2006 Chapter 7 Implementing classes.
ARRAYS AND ARRAYLISTS Chapter 7. Array  Sequence of values of the same type  Primitive types  Objects  Create an Array  double[] values = new double[10]
Chapter 6Java: an Introduction to Computer Science & Programming - Walter Savitch 1 l Array Basics l Arrays in Classes and Methods l Programming with Arrays.
Java Programming Week 6: Array and ArrayList Chapter 7.
For each primitive type there is a wrapper class for storing values of that type: Double d = new Double(29.95); Wrapper Classes Wrapper objects can be.
Week 9-10 – Arrays and Array Lists Big Java by Cay Horstmann Copyright © 2009 by John Wiley & Sons. All rights reserved.
Chapter 6 Iteration.  Executes a block of code repeatedly  A condition controls how often the loop is executed while (condition) statement  Most commonly,
Big Java by Cay Horstmann Copyright © 2008 by John Wiley & Sons. All rights reserved. Chapter Seven: Arrays and Array Lists.
ICOM 4015: Advanced Programming Lecture 7 Big Java by Cay Horstmann Copyright © 2009 by John Wiley & Sons. All rights reserved. Reading: Chapter Seven:
Week 10 Introduction to Computer Science and Object-Oriented Programming COMP 111 George Basham.
ARRAYLIST Collections of Data. ArrayLists Array lists can grow and shrink as needed ArrayList is a generic class (similar to C++ template) ArrayList has.
Chapter 6: Iteration Part 1. To be able to program loops with the while, for, and do statements To avoid infinite loops and off-by-one errors To understand.
The while Loop Syntax while (condition) { statements } As long condition is true, the statements in the while loop execute.
Arrays Module 6. Objectives Nature and purpose of an array Using arrays in Java programs Methods with array parameter Methods that return an array Array.
Arrays and ArrayLists in Java L. Kedigh. Array Characteristics List of values. A list of values where every member is of the same type. Each member in.
Object-Oriented Program Development Using Java: A Class-Centered Approach, Enhanced Edition.
Chapter 8: Collections: Arrays. 2 Objectives One-Dimensional Arrays Array Initialization The Arrays Class: Searching and Sorting Arrays as Arguments The.
When constructing a two-dimensional array, specify how many rows and columns are needed: final int ROWS = 3; final int COLUMNS = 3; String[][] board =
The while Loop Syntax while (condition) { statements } As long condition is true, the statements in the while loop execute.
Arrays Construct array: new double[10] Store in variable of type double[] double[] data = new double[10];
ArrayList Class An ArrayList is an object that contains a sequence of elements that are ordered by position. An ArrayList is an object that contains a.
Fall 2006Slides adapted from Java Concepts companion slides1 Arrays and Array Lists Advanced Programming ICOM 4015 Lecture 7 Reading: Java Concepts Chapter.
Loops (cont.). Loop Statements  while statement  do statement  for statement while ( condition ) statement; do { statement list; } while ( condition.
Chapter 7 – Arrays and Array Lists Big Java by Cay Horstmann Copyright © 2009 by John Wiley & Sons. All rights reserved.
Chapter 6 – Arrays and Array Lists Big Java by Cay Horstmann Copyright © 2009 by John Wiley & Sons. All rights reserved.
Arrays and ArrayLists Topic 6. One Dimensional Arrays Homogeneous – all of the same type Contiguous – all elements are stored sequentially in memory For.
Arrays. Array: Sequence of values of the same type Construct array: Store in variable of type double[ ] new double[10] double[] data = new double[10];
Chapter 7 – Arrays and Array Lists Big Java by Cay Horstmann Copyright © 2009 by John Wiley & Sons. All rights reserved. 1.
int [] scores = new int [10];
Array Size Arrays use static allocation of space. That is, when the array is created, we must specify the size of the array, e.g., int[] grades = new int[100];
When constructing a two-dimensional array, specify how many rows and columns are needed: final int ROWS = 3; final int COLUMNS = 3; String[][] board =
Chapter 8 Slides from GaddisText Arrays of more than 1 dimension.
1 Flow of Control Chapter 5. 2 Objectives You will be able to: Use the Java "if" statement to control flow of control within your program.  Use the Java.
Copyright © 2014 by John Wiley & Sons. All rights reserved.1 Decisions and Iterations.
Array: Sequence of values of the same type Construct array: new double[10] Store in variable of type double[] : double[] data = new double[10]; When array.
CS 115 OBJECT ORIENTED PROGRAMMING I LECTURE 11 GEORGE KOUTSOGIANNAKIS 1 Copyright: 2015 Illinois Institute of Technology_ George Koutsogiannakis.
Chapter 3 Implementing Classes
VISUAL C++ PROGRAMMING: CONCEPTS AND PROJECTS Chapter 7A Arrays (Concepts)
Chapter 9 Introduction to Arrays Fundamentals of Java.
Chapter 7 – Arrays and Array Lists Big Java by Cay Horstmann Copyright © 2009 by John Wiley & Sons. All rights reserved.
Week 9 Introduction to Computer Science and Object-Oriented Programming COMP 111 George Basham.
Chapter 7 Iteration. Chapter Goals To be able to program loops with the while, for, and do statements To avoid infinite loops and off-by-one errors To.
A 2-D Array is a structure that storage space both vertically and horizontally. Thus, the array has both rows and columns. 2-D Arrays are used to create.
Chapter 7 – Arrays and Array Lists
Principles of Computer Science I
Chapter 7 – Arrays and Array Lists
Chapter 8 – Arrays and Array Lists
7.6 Common Array Algorithm: Filling
Lecture Notes – Arrays and ArrayLists (Ch 7-8)
Introduction to Computer Science and Object-Oriented Programming
Chapter Three - Implementing Classes
Chapter 8 Arrays and Array Lists
int [] scores = new int [10];
int [] scores = new int [10];
Presentation transcript:

Chapter 7: Arrays and Array Lists

To become familiar with using arrays and array lists To learn about wrapper classes, auto-boxing and the generalized for loop To study common array algorithms To learn how to use two-dimensional arrays To understand when to choose array lists and arrays in your programs To implement partially filled arrays To understand the concept of regression testing Chapter Goals

Array: Sequence of values of the same type Construct array: new double[10] Store in variable of type double[] double[] data = new double[10]; When array is created, all values are initialized depending on array type: Numbers: 0 Boolean : false Object References: null Arrays

Storing a value: data[2] = 29.95;

Using the value stored: System.out.println("The value of this data item is " + data[4]); Get array length as data.length (Not a method!) Index values range from 0 to length - 1 Accessing a nonexistent element results in a bounds error double[] data = new double[10]; data[10] = 29.95; // ERROR Limitation: Arrays have fixed length. If you need to store more items than were originally allocated you have two options: Copy the old array into a new larger array Use an ArrayList Arrays

new typeName[length] Example: new double[10] Purpose: To construct an array with a given number of elements. Syntax 7.1 Array Construction

arrayReference[index] Example: data[2] Purpose: To access an element in an array. Syntax 7.2 Array Element Access

What elements does the data array contain after the following statements? double[] data = new double[10]; for (int i = 0; i < data.length; i++) data[i] = i * i; Answer: 0, 1, 4, 9, 16, 25, 36, 49, 64, 81, but not 100 Self Check 7.1

What do the following program segments print? Or, if there is an error, describe the error and specify whether it is detected at compile-time or at run-time. a)double[] a = new double[10]; System.out.println(a[0]); b)double[] b = new double[10]; System.out.println(b[10]); c)double[] c; System.out.println(c[0]); Answer: a) 0 b) a run-time error: array index out of bounds c) a compile-time error: c is not initialized Self Check 7.2

The ArrayList class manages a sequence of objects Can grow and shrink as needed ArrayList class supplies methods for many common tasks, such as inserting and removing elements The ArrayList class is a generic class: ArrayList contains objects of type T : ArrayList accounts = new ArrayList (); accounts.add(new BankAccount(1001)); accounts.add(new BankAccount(1015)); accounts.add(new BankAccount(1022)); size method yields number of elements Array Lists

Use get method Index starts at 0 BankAccount anAccount = accounts.get(2); // gets the third element of the array list Bounds error if index is out of range Most common bounds error: int i = accounts.size(); anAccount = accounts.get(i); // Error //legal index values are 0...i-1 Retrieving Array List Elements

set overwrites an existing value BankAccount anAccount = new BankAccount(1729); accounts.set(2, anAccount); add adds to the end accounts.add(new BankAccount(1001)); add can also be used to insert a new value at a given position (this pushes items at positions 1 to size-1 back by one): accounts.add(1, new BankAccount(1008)); Adding Elements Continued

Adding Elements (cont.) accounts.add(i, a);

remove removes an element at a given index: accounts.remove(i) Removing Elements

01: import java.util.ArrayList; 02: 03: /** 04: This program tests the ArrayList class. 05: */ 06: public class ArrayListTester 07: { 08: public static void main(String[] args) 09: { 10: ArrayList accounts 11: = new ArrayList (); 12: accounts.add(new BankAccount(1001)); 13: accounts.add(new BankAccount(1015)); 14: accounts.add(new BankAccount(1729)); 15: accounts.add(1, new BankAccount(1008)); 16: accounts.remove(0); 17: 18: System.out.println("Size: " + accounts.size()); 19: System.out.println("Expected: 3"); 20: BankAccount first = accounts.get(0); ch07/arraylist/ArrayListTester.java Continued

21: System.out.println("First account number: " 22: + first.getAccountNumber()); 23: System.out.println("Expected: 1015"); 24: BankAccount last = accounts.get(accounts.size() - 1); 25: System.out.println("Last account number: " 26: + last.getAccountNumber()); 27: System.out.println("Expected: 1729"); 28: } 29: } ch07/arraylist/ArrayListTester.java (cont.) Output: Size: 3 Expected: 3 First account number: 1008 Expected: 1008 Last account number: 1729 Expected: 1729

01: /** 02: A bank account has a balance that can be changed by 03: deposits and withdrawals. 04: */ 05: public class BankAccount 06: { 07: /** 08: Constructs a bank account with a zero balance anAccountNumber the account number for this account 10: */ 11: public BankAccount(int anAccountNumber) 12: { 13: accountNumber = anAccountNumber; 14: balance = 0; 15: } 16: 17: /** 18: Constructs a bank account with a given balance anAccountNumber the account number for this account initialBalance the initial balance 21: */ ch07/arraylist/BankAccount.java Continued

22: public BankAccount(int anAccountNumber, double initialBalance) 23: { 24: accountNumber = anAccountNumber; 25: balance = initialBalance; 26: } 27: 28: /** 29: Gets the account number of this bank account. the account number 31: */ 32: public int getAccountNumber() 33: { 34: return accountNumber; 35: } 36: 37: /** 38: Deposits money into the bank account. amount the amount to deposit 40: */ 41: public void deposit(double amount) 42: { 43: double newBalance = balance + amount; 44: balance = newBalance; 45: } ch07/arraylist/BankAccount.java (cont.) Continued

46: 47: /** 48: Withdraws money from the bank account. amount the amount to withdraw 50: */ 51: public void withdraw(double amount) 52: { 53: double newBalance = balance - amount; 54: balance = newBalance; 55: } 56: 57: /** 58: Gets the current balance of the bank account. the current balance 60: */ 61: public double getBalance() 62: { 63: return balance; 64: } 65: 66: private int accountNumber; 67: private double balance; 68: } ch07/arraylist/BankAccount.java (cont.) Continued

How do you construct an array of 10 strings? An array list of strings? Answer: new String[10]; new ArrayList (); Self Check 7.3

What is the content of names after the following statements? ArrayList names = new ArrayList (); names.add("A"); names.add(0, "B"); names.add("C"); names.remove(1); Answer: names contains the strings "B" and "C" at positions 0 and 1 Self Check 7.4

An ArrayList can hold references to any type of object. We specify a particular type of object surrounded by angle brackets: ArrayList accounts = new ArrayList (); This is known as a parameterized ArrayList. An ArrayList does not absolutely have to be parameterized: ArrayList accounts = new ArrayList(); accounts.add(new BankAccount(1729)); BankAccount a = (BankAccount) accounts.get(0); accounts.add(“A String!”); String b = (String) accounts.get(1); ArrayLists can store any type of object. However, we must cast references from get to the right type. This is awkward and is a potential source of error. Therefore, you should prefer to use parameterized ArrayLists.

ArrayLists store object references only. Thus, you cannot insert primitive types directly into array lists: ArrayList = new ArrayList (); // Error! To treat primitive type values as objects, you must use wrapper classes: ArrayList data = new ArrayList (); data.add(new Double(29.95)); Double d = data.get(0); Wrappers

There are wrapper classes for all eight primitive types: Wrappers Important: Wrapper classes are immutable. Their contents can never be changed!.

Auto-boxing: Starting with Java 5.0, conversion between primitive types and the corresponding wrapper classes is automatic. Double d = 29.95; // auto-boxing; same as Double d = new Double(29.95); double x = d; // auto-unboxing; same as double x = d.doubleValue(); Auto-boxing even works inside arithmetic expressions Double e = d + 1; Means: auto-unbox d into a double add 1 auto-box the result into a new Double store a reference to the newly created wrapper object in e Auto-boxing

What is the difference between the types double and Double ? Answer: double is one of the eight primitive types. Double is a class type. Self Check 7.5

Suppose data is an ArrayList of size > 0. How do you increment the element with index 0? Actually, you cannot increment a Double. But you can store a new one which is 1 + the old one. Answer: data.set(0, data.get(0) + 1); Self Check 7.6

Traverses all elements of a collection: double[] data =...; double sum = 0; for (double e : data) // You should read this loop as { // "for each e in data" sum = sum + e; } Traditional alternative: double[] data =...; double sum = 0; for (int i = 0; i < data.length; i++) { double e = data[i]; sum = sum + e; } The Generalized for Loop

Works for ArrayLists too: ArrayList accounts =... ; double sum = 0; for (BankAccount a : accounts) { sum = sum + a.getBalance(); } Equivalent to the following ordinary for loop: double sum = 0; for (int i = 0; i < accounts.size(); i++) { BankAccount a = accounts.get(i); sum = sum + a.getBalance(); } The Generalized for Loop

for (Type variable : collection) statement Example: for (double e : data) sum = sum + e; Purpose: To execute a loop for each element in the collection. In each iteration, the variable is assigned the next element of the collection. Then the statement is executed. Syntax 7.3 The "for each" Loop

Write a "for each" loop that prints all elements in the array data. Answer: for (double x : data) System.out.println(x); Self Check 7.7

Why is the "for each" loop not an appropriate shortcut for the following ordinary for loop? for (int i = 0; i < data.length; i++) data[i] = i * i; Answer: The loop writes a value into data[i]. The "for each" loop does not have the index variable i. Self Check 7.8

Check all elements and count the matches until you reach the end of the array list. public class Bank { public int count(double atLeast) { int matches = 0; for (BankAccount a : accounts) { if (a.getBalance() >= atLeast) matches++; // Found a match } return matches; }... private ArrayList accounts; } Simple Array Algorithms: Counting Matches

Check all elements until you have found a match. public class Bank { public BankAccount find(int accountNumber) { for (BankAccount a : accounts) { if (a.getAccountNumber() == accountNumber) // Found a match return a; } return null; // No match in the entire array list }... } Simple Array Algorithms: Finding a Value

Initialize a candidate with the starting element Compare candidate with remaining elements Update it if you find a larger or smaller value Example: BankAccount largestYet = accounts.get(0); for (int i = 1; i < accounts.size(); i++) { BankAccount a = accounts.get(i); if (a.getBalance() > largestYet.getBalance()) largestYet = a; } return largestYet; Works only if there is at least one element in the array list... Simple Array Algorithms: Finding the Maximum or Minimum Continued

If list is empty, return null : if (accounts.size() == 0) return null; BankAccount largestYet = accounts.get(0);... Simple Array Algorithms: Finding the Maximum or Minimum (cont.)

01: import java.util.ArrayList; 02: 03: /** 04: This bank contains a collection of bank accounts. 05: */ 06: public class Bank 07: { 08: /** 09: Constructs a bank with no bank accounts. 10: */ 11: public Bank() 12: { 13: accounts = new ArrayList (); 14: } 15: 16: /** 17: Adds an account to this bank. a the account to add 19: */ 20: public void addAccount(BankAccount a) 21: { 22: accounts.add(a); 23: } ch07/bank/Bank.java Continued

24: 25: /** 26: Gets the sum of the balances of all accounts in this bank. the sum of the balances 28: */ 29: public double getTotalBalance() 30: { 31: double total = 0; 32: for (BankAccount a : accounts) 33: { 34: total = total + a.getBalance(); 35: } 36: return total; 37: } 38: 39: /** 40: Counts the number of bank accounts whose balance is at 41: least a given value. atLeast the balance required to count an account the number of accounts having least the given balance 44: */ 45: public int count(double atLeast) 46: { ch07/bank/Bank.java (cont.) Continued

47: int matches = 0; 48: for (BankAccount a : accounts) 49: { 50: if (a.getBalance() >= atLeast) matches++; // Found a match 51: } 52: return matches; 53: } 54: 55: /** 56: Finds a bank account with a given number. accountNumber the number to find the account with the given number, or null if there 59: is no such account 60: */ 61: public BankAccount find(int accountNumber) 62: { 63: for (BankAccount a : accounts) 64: { 65: if (a.getAccountNumber() == accountNumber) // Found a match 66: return a; 67: } 68: return null; // No match in the entire array list 69: } 70: ch07/bank/Bank.java (cont.) Continued

71: /** 72: Gets the bank account with the largest balance. the account with the largest balance, or null if the 74: bank has no accounts 75: */ 76: public BankAccount getMaximum() 77: { 78: if (accounts.size() == 0) return null; 79: BankAccount largestYet = accounts.get(0); 80: for (int i = 1; i < accounts.size(); i++) 81: { 82: BankAccount a = accounts.get(i); 83: if (a.getBalance() > largestYet.getBalance()) 84: largestYet = a; 85: } 86: return largestYet; 87: } 88: 89: private ArrayList accounts; 90: } ch07/bank/Bank.java (cont.)

01: /** 02: This program tests the Bank class. 03: */ 04: public class BankTester 05: { 06: public static void main(String[] args) 07: { 08: Bank firstBankOfJava = new Bank(); 09: firstBankOfJava.addAccount(new BankAccount(1001, 20000)); 10: firstBankOfJava.addAccount(new BankAccount(1015, 10000)); 11: firstBankOfJava.addAccount(new BankAccount(1729, 15000)); 12: 13: double threshold = 15000; 14: int c = firstBankOfJava.count(threshold); 15: System.out.println("Count: " + c); 16: System.out.println("Expected: 2"); 17: 18: int accountNumber = 1015; 19: BankAccount a = firstBankOfJava.find(accountNumber); 20: if (a == null) ch07/bankBankTester.java Continued

21: System.out.println("No matching account"); 22: else 23: System.out.println("Balance of matching account: " + a.getBalance()); 24: System.out.println("Expected: 10000"); 25: 26: BankAccount max = firstBankOfJava.getMaximum(); 27: System.out.println("Account with largest balance: " 28: + max.getAccountNumber()); 29: System.out.println("Expected: 1001"); 30: } 31: } Output: Count: 2 Expected: 2 Balance of matching account: Expected: Account with largest balance: 1001 Expected: 1001 ch07/bankBankTester.java (cont.)

What does the find method do if there are two bank accounts with a matching account number? Answer: It returns the first match that it finds. Self Check 7.9

Would it be possible to use a "for each" loop in the getMaximum method? Answer: Yes, but the first comparison would always fail. Self Check 7.10

When constructing a two-dimensional array, you specify how many rows and columns you need: final int ROWS = 3; final int COLUMNS = 3; String[][] board = new String[ROWS][COLUMNS]; This gives the following 2-D array: board[0][0] board[0][1] board[0][2] board[1][0] board[1][1] board[1][2] board[2][0] board[2][1] board[2][2] You access elements with an index pair a[i][j] board[i][j] = "x"; Two-Dimensional Arrays

It is common to use two nested loops when filling or searching. The following initializes a board for Tic-Tac-Toe: for (int i = 0; i < ROWS; i++) for (int j = 0; j < COLUMNS; j++) board[i][j] = " "; Traversing Two-Dimensional Arrays

01: /** 02: A 3 x 3 tic-tac-toe board. 03: */ 04: public class TicTacToe 05: { 06: /** 07: Constructs an empty board. 08: */ 09: public TicTacToe() 10: { 11: board = new String[ROWS][COLUMNS]; 12: // Fill with spaces 13: for (int i = 0; i < ROWS; i++) 14: for (int j = 0; j < COLUMNS; j++) 15: board[i][j] = " "; 16: } 17: 18: /** 19: Sets a field in the board. The field must be unoccupied. i the row index j the column index player the player ("x" or "o") 23: */ ch07/twodim/TicTacToe.java Continued

24: public void set(int i, int j, String player) 25: { 26: if (board[i][j].equals(" ")) 27: board[i][j] = player; 28: } 29: 30: /** 31: Creates a string representation of the board, such as 32: |x o| 33: | x | 34: | o| the string representation 36: */ 37: public String toString() 38: { 39: String r = ""; 40: for (int i = 0; i < ROWS; i++) 41: { 42: r = r + "|"; 43: for (int j = 0; j < COLUMNS; j++) 44: r = r + board[i][j]; 45: r = r + "|\n"; 46: } 47: return r; 48: } Continued

49: 50: private String[][] board; 51: private static final int ROWS = 3; 52: private static final int COLUMNS = 3; 53: } ch07/twodim/TicTacToe.java (cont.)

01: import java.util.Scanner; 02: 03: /** 04: This program runs a TicTacToe game. It prompts the 05: user to set positions on the board and prints out the 06: result. 07: */ 08: public class TicTacToeRunner 09: { 10: public static void main(String[] args) 11: { 12: Scanner in = new Scanner(System.in); ch07/twodim/TicTacToeRunner.java Continued

13: String player = "x"; 14: TicTacToe game = new TicTacToe(); 15: boolean done = false; 16: while (!done) 17: { 18: System.out.print(game.toString()); 19: System.out.print( 20: "Row for " + player + " (-1 to exit): "); 21: int row = in.nextInt(); 22: if (row < 0) done = true; 23: else 24: { 25: System.out.print("Column for " + player + ": "); 26: int column = in.nextInt(); 27: game.set(row, column, player); 28: if (player.equals("x")) 29: player = "o"; 30: else 31: player = "x"; 32: } 33: } 34: } 35: } ch07/twodim/TicTacToeRunner.java (cont.)

Output: | Row for x (-1 to exit): 1 Column for x: 2 | | x | | Row for o (-1 to exit): 0 Column for o: 0 |o | | x | | Row for x (-1 to exit): -1 ch07/twodim/TicTacToeRunner.java (cont.)

How do you declare and initialize a 4-by-4 array of integers? Answer: int[][] array = new int[4][4]; Self Check 7.11

How do you count the number of spaces in the tic-tac-toe board? Answer: int count = 0; for (int i = 0; i < ROWS; i++) for (int j = 0; j < COLUMNS; j++) if (board[i][j] == ' ') count++; Self Check 7.12

An image is essentially a 2-D array A grayscale image can be represented by a single 2-D array A colour image requires one 2-D array for each colour (usually red, green, and blue). The following example applies the very simple operation of thresholding. This means selecting some threshold value and setting all image pixels smaller than this value to 0 and all those which are greater than or equal to the threshold to the maximum value (often 255). Simple Image Processing

import java.util.Random; public class Threshold { public static void main(String args[]) { final int WIDTH = 5; final int HEIGHT = 4; int[][] image = new int[HEIGHT][WIDTH]; // Randomly fill image Random random = new Random(); for (int i = 0; i < HEIGHT; i++) for (int j = 0; j < WIDTH; j++) image[i][j] = random.nextInt(256); // Set all elements below the threshold // to 0, and all others to 255. int threshold = 127; for (int i = 0; i < HEIGHT; i++) for (int j = 0; j < WIDTH; j++) { if (image[i][j] < threshold) image[i][j] = 0; else image[i][j] = 1; } // Print the final array for (int i = 0; i < HEIGHT; i++) { for (int j = 0; j < WIDTH; j++) System.out.print(image[i][j] + " "); System.out.println(); } } }

Copying an array variable yields a second reference to the same array double[] data = new double[10]; // fill array... double[] prices = data; Copying Arrays: Copying Array References

Use clone to make true copy double[] prices = (double[]) data.clone(); Copying Arrays: Cloning Arrays

System.arraycopy(from, fromStart, to, toStart, count); Copying Arrays: Copying Array Elements

System.arraycopy(data, i, data, i + 1, data.length - i -1); data[i] = x; Adding an Element to an Array

System.arraycopy(data, i + 1, data, i, data.length - i - 1); Removing an Element from an Array

If the array is full and you need more space, you can grow the array: Create a new, larger array: double[] newData = new double[2 * data.length]; Copy all elements into the new array: System.arraycopy(data, 0, newData, 0, data.length); Store the reference to the new array in the array variable: data = newData; Growing an Array

double[] newData = new double[2 * data.length] System.arraycopy(data, 0, newData, 0, data.length) data = newData; Continued Growing an Array

How do you add or remove elements in the middle of an array list? Answer: Use the insert and remove methods. Self Check 7.13

Why do we double the length of the array when it has run out of space rather than increasing it by one element? Answer: Allocating a new array and copying the elements is time-consuming. You wouldn't want to go through the process every time you add an element. Self Check 7.14

public class CopyArray { public static void main(String args[]) { // We begin with the array int[] array = new int[5]; array[0] = 10; array[1] = 20; array[2] = 40; array[3] = 50; array[4] = 60; // We now wish to modify this array so that it // contains (10, 20, 30, 40, 50). First, we // move the 40 and 50 to their final positions. System.arraycopy(array, 2, array, 3, 2); // Now put in the 30 array[2] = 30; Example

// Print the array System.out.println("The array:"); for (int i = 0; i < array.length; i++) System.out.print(array[i] + " "); System.out.println(""); // Now we want to add 60 to the end of the array. // We must first grow the array to be of length 6. // This requires allocating a new array, and // copying the old array into it. int[] biggerArray = new int[array.length + 1]; System.arraycopy(array, 0, biggerArray, 0, array.length); biggerArray[5] = 60; array = biggerArray;

// Print using a generalized for loop System.out.println("The array:"); for (int data : array) System.out.print(data + " "); System.out.println(""); } } Output: The array: The array:

// Don't do this int[] accountNumbers; double[] balances; Make Parallel Arrays into Arrays of Objects

Avoid parallel arrays by changing them into arrays of objects: BankAccount[] accounts; Make Parallel Arrays into Arrays of Objects

If you are reading input (e.g. from the user) you may not know how much input is coming. But if you know that there will be no more than X input data items, you can create an array of length X and keep track of the actual size of the data in another variable. Give the name of the size variable as the name of the array plus “ Size ” final int DATA_LENGTH = 100; double[] data = new double[DATA_LENGTH]; int dataSize = 0; Update dataSize as array is filled: data[dataSize] = x; dataSize++; Partially Filled Arrays

Partially Filled Arrays (cont.)