JAva Array

Chapter 6 Arrays
Basic computer skills such as using Windows,

Internet Explorer, and Microsoft Word
Chapter 1 Introduction to Computers, Programs,

and Java
Chapter 2 Primitive Data Types and Operations
Chapter 3 Selection Statements
Chapter 4 Loops
Chapter 5 Methods §§19.1-19.3 in Chapter 19 Recursion
Chapter 6 Arrays Chapter 23 Algorithm Efficiency and Sorting
Liang, Introduction to Java Programming, Sixth Edition, (c) 2007 Pearson Education, Inc. All
rights reserved. 0-13-222158-6
1
Objectives
 To describe why an array is necessary in programming (§6.1).
 To learn the steps involved in using arrays: declaring array
reference variables and creating arrays (§6.2).
 To initialize the values in an array (§6.2).
 To simplify programming using JDK 1.5 enhanced for loop (§6.2).
 To copy contents from one array to another (§6.3).
 To develop and invoke methods with array arguments and ruturn
type (§6.4-6.5).
 To sort an array using the selection sort algorithm (§6.6).
 To search elements using the linear or binary search algorithm
(§6.7).
 To declare and create multidimensional arrays (§6.8).
 To declare and create multidimensional arrays (§6.9 Optional).
2
Introducing Arrays
Array is a data structure that represents a collection of the
same types of data.
double[] myList = new double[10];
myList reference
myList[0] 5.6
myList[1] 4.5
Array reference myList[2] 3.3

variable
myList[3] 13.2
myList[4] 4
Array element at
myList[5] 34.33 Element value
index 5
myList[6] 34
myList[7] 45.45
myList[8] 99.993
myList[9] 11123
3
Declaring Array Variables
 datatype[] arrayRefVar;
Example:
double[] myList;
 datatype arrayRefVar[]; // This style is

allowed, but not preferred
Example:
double myList[];
4
Creating Arrays
arrayRefVar = new datatype[arraySize];
Example:
myList = new double[10];
myList[0] references the first element in the array.

myList[9] references the last element in the array.
5
Declaring and Creating
in One Step
 datatype[] arrayRefVar = new
datatype[arraySize];
 datatype arrayRefVar[] = new

datatype[arraySize];
double myList[] = new double[10];
6
The Length of an Array
Once an array is created, its size is fixed. It cannot be
changed. You can find its size using
arrayRefVar.length
For example,
myList.length returns 10
7
Default Values
When an array is created, its elements are
assigned the default value of
0 for the numeric primitive data types,

'\u0000' for char types, and
false for boolean types.
8
Indexed Variables
The array elements are accessed through the index. The
array indices are 0-based, i.e., it starts from 0 to
arrayRefVar.length-1. In the example in Figure 6.1,
myList holds ten double values and the indices are
from 0 to 9.
Each element in the array is represented using the

following syntax, known as an indexed variable:
arrayRefVar[index];
9
Using Indexed Variables
After an array is created, an indexed variable can
be used in the same way as a regular variable.
For example, the following code adds the value
in myList[0] and myList[1] to myList[2].
myList[2] = myList[0] + myList[1];
10
Array Initializers
 Declaring, creating, initializing in one step:
double[] myList = {1.9, 2.9, 3.4, 3.5};
This shorthand syntax must be in one

statement.
11
Declaring, creating, initializing
Using the Shorthand Notation
double[] myList = {1.9, 2.9, 3.4, 3.5};
This shorthand notation is equivalent to the

following statements:
myList[0] = 1.9;
myList[1] = 2.9;
myList[2] = 3.4;
myList[3] = 3.5;
12
CAUTION
Using the shorthand notation, you
have to declare, create, and initialize
the array all in one statement.
Splitting it would cause a syntax
error. For example, the following is
wrong:
double[] myList;
myList = {1.9, 2.9, 3.4, 3.5};

13
animation
Trace Program with Arrays
Declare array variable values, create an
array, and assign its reference to values
public class Test {

public static void main(String[] args) { After the array is created
int[] values = new int[5]; 0 0

for (int i = 1; i < 5; i++) { 1 0
values[i] = values[i] + values[i-1]; 2 0
} 3 0
values[0] = values[1] + values[4]; 4 0
}
}
14
animation
i becomes 1
public class Test {

public static void main(String[] args) {
After the array is created
int[] values = new int[5];
for (int i = 1; i < 5; i++) { 0 0
0
} 2
3 0
values[0] = values[1] + values[4]; 0
4
}
}
15
animation
i (=1) is less than 5
public class Test {

After the array is created
for (int i = 1; i < 5; i++) { 0 0
} 2 0
0
} 4
16
animation
After this line is executed, value[1] is 1
public class Test {

public static void main(String[] args) { After the first iteration

for (int i = 1; i < 5; i++) { 1 1
values[i] = i + values[i-1]; 2 0
} 3 0
}
}
17
animation

After i++, i becomes 2
public class Test {

int[] values = new int[5]; After the first iteration
for (int i = 1; i < 5; i++) {

0 0
} 2 0
3 0
}
}
18
animation
i (= 2) is less than 5
public class Test {
for (int i = 1; i < 5; i++) { After the first iteration
values[i] = values[i] + values[i-1];

0 0
} 1
1
} 3 0
} 4 0
19
animation
After this line is executed,
values[2] is 3 (2 + 1)
public class Test {

public static void main(String[] args) { After the second iteration

for (int i = 1; i < 5; i++) { 1 1
} 3 0
}
}
20
animation
After this, i becomes 3.
public class Test {


for (int i = 1; i < 5; i++) { 1 1
} 3 0
}
}
21
animation
i (=3) is still less than 5.
public class Test {


for (int i = 1; i < 5; i++) { 1 1
} 3 0
}
}
22
animation
After this line, values[3] becomes 6 (3 + 3)
public class Test {

public static void main(String[] args) { After the third iteration

for (int i = 1; i < 5; i++) { 1 1
} 3 6
}
}
23
animation
After this, i becomes 4
public class Test {


for (int i = 1; i < 5; i++) { 1 1
} 3 6
}
}
24
animation
i (=4) is still less than 5
public class Test {


for (int i = 1; i < 5; i++) { 1 1
} 3 6
}
}
25
animation
After this, values[4] becomes 10 (4 + 6)
public class Test {

public static void main(String[] args) { After the fourth iteration

for (int i = 1; i < 5; i++) { 1 1
} 3 6
}
}
26
animation
After i++, i becomes 5
public class Test {

public static void main(String[] args)
{
for (int i = 1; i < 5; i++) {
After the fourth iteration
values[i] = i + values[i-1];
}
0 0
values[0] = values[1] + values[4]; 1
1
}
2 3
}
3 6
4 10
27
animation

i ( =5) < 5 is false. Exit the loop
public class Test {

for (int i = 1; i < 5; i++) { After the fourth iteration
values[i] = i + values[i-1];
} 0 0
1 1
} 3 6
} 4 10
28
animation
After this line, values[0] is 11 (1 + 10)
public class Test {

for (int i = 1; i < 5; i++) { 0 11
} 2 3
} 4 10
29
Processing Arrays
See the examples in the text.
1. (Initializing arrays)
2. (Printing arrays)
3. (Summing all elements)
4. (Finding the largest element)
5. (Finding the smallest index of the largest
element)
30
JDK 1.5
Feature Enhanced for Loop
JDK 1.5 introduced a new for loop that enables you to traverse the complete array
sequentially without using an index variable. For example, the following code
displays all elements in the array myList:
for (double value: myList)

System.out.println(value);
In general, the syntax is
for (elementType value: arrayRefVar) {

// Process the value
}
You still have to use an index variable if you wish to traverse the array in a
different order or change the elements in the array.
31
Example: Testing Arrays
 Objective: The program receives 6 numbers from
the user, finds the largest number and counts the
occurrence of the largest number entered.
Suppose you entered 3, 5, 2, 5, 5, and 5, the
largest number is 5 and its occurrence count is 4.
TestArray Run
32
JBuilder
Optional See Arrays in JBuilder Debugger
You can trace the value of
array elements in the
debugger.
Array
33
Example: Assigning Grades
 Objective: read student scores (int), get the best
score, and then assign grades based on the
following scheme:
– Grade is A if score is >= best–10;
– Grade is B if score is >= best–20;
AssignGrade
– Grade is C if score is >= best–30;
– Grade is D if score is >= best–40; Run
– Grade is F otherwise.
34
Copying Arrays
Often, 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;
Before the assignment After the assignment
list2 = list1; list2 = list1;
list1 list1
Contents Contents
of list1 of list1
list2 list2
Contents Contents
of list2 of list2
Garbage
35
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];
36
The arraycopy Utility
arraycopy(sourceArray, src_pos,
targetArray, tar_pos, length);
Example:
System.arraycopy(sourceArray, 0,
targetArray, 0, sourceArray.length);
37
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
38
Anonymous Array
The 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.
39
Pass By Value
Java uses pass by value to pass parameters 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.
40
Simple Example
public class Test {
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]
}
}
41
Call Stack
Stack Heap
Space required for
method m
int[] numbers:reference
The arrays are
int number: 1 Array of stored in a
ten int heap.
Space required for the values is
main method stored here
int[] y: reference
int x: 1
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.
42
Heap
Stack Heap
Space required for
xMethod
int[] numbers:reference
The arrays are
int number: 1 Array of stored in a
ten int heap.
Space required for the values are
main method stored here
int[] y: reference
int x: 1
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.
43
Example:
Passing Arrays as Arguments
 Objective:Demonstrate differences of
passing primitive data type variables
and array variables.
TestPassArray Run
44
Example, cont.
Stack Heap Stack
Space required for the
Space required for the swapFirstTwoInArray
swap method method
n2: 2 int[] array reference
n1: 1
Space required for the Space required for the

main method main method
int[] a reference int[] a reference
a[1]: 2
a[0]: 1
Invoke swap(int n1, int n2). Invoke swapFirstTwoInArray(int[] array).
The primitive type values in The arrays are The reference value in a is passed to the
a[0] and a[1] are passed to the stored in a swapFirstTwoInArray method.
swap method. heap.
45
Returning an Array from a Method
public 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];
}
list
return result;
} result
int[] list1 = new int[]{1, 2, 3, 4, 5, 6};

int[] list2 = reverse(list1);
46
animation
Trace the reverse Method

int[] list1 = new int[]{1, 2, 3, 4, 5, 6};
Declare result and create array

}
return result;
}
list 1 2 3 4 5 6
result 0 0 0 0 0 0
47
animation
Trace the reverse Method, cont.

int[] list1 = new int[]{1, 2, 3, 4, 5, 6};
i = 0 and j = 5

}
return result;
}
list 1 2 3 4 5 6
result 0 0 0 0 0 0
48
animation

int[] list1 = new int[]{1, 2, 3, 4, 5, 6};
i (= 0) is less than 6

}
return result;
}
list 1 2 3 4 5 6
result 0 0 0 0 0 0
49
animation

int[] list1 = new int[]{1, 2, 3, 4, 5, 6};
i = 0 and j = 5
public static int[] reverse(int[] list) { Assign list[0] to result[5]

}
return result;
}
list 1 2 3 4 5 6
result 0 0 0 0 0 1
50
animation

int[] list1 = new int[]{1, 2, 3, 4, 5, 6};
After this, i becomes 1 and j

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

}
return result;
}
list 1 2 3 4 5 6
result 0 0 0 0 0 1
51
animation

int[] list1 = new int[]{1, 2, 3, 4, 5, 6};
i (=1) is less than 6


}
return result;
}
list 1 2 3 4 5 6
result 0 0 0 0 0 1
52
animation

int[] list1 = new int[]{1, 2, 3, 4, 5, 6};
i = 1 and j = 4
public static int[] reverse(int[] list) { Assign list[1] to result[4]

}
return result;
}
list 1 2 3 4 5 6
result 0 0 0 0 2 1
53
animation

int[] list1 = new int[]{1, 2, 3, 4, 5, 6};
After this, i becomes 2 and
public static int[] reverse(int[] list) { j becomes 3

}
return result;
}
list 1 2 3 4 5 6
result 0 0 0 0 2 1
54
animation

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

}
return result;
}
list 1 2 3 4 5 6
result 0 0 0 0 2 1
55
animation

int[] list1 = new int[]{1, 2, 3, 4, 5, 6};
i = 2 and j = 3
public static int[] reverse(int[] list) { Assign list[i] to result[j]

}
return result;
}
list 1 2 3 4 5 6
result 0 0 0 3 2 1
56
animation

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

}
return result;
}
list 1 2 3 4 5 6
result 0 0 0 3 2 1
57
animation

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

}
return result;
}
list 1 2 3 4 5 6
result 0 0 0 3 2 1
58
animation

int[] list1 = new int[]{1, 2, 3, 4, 5, 6};
i = 3 and j = 2

}
return result;
}
list 1 2 3 4 5 6
result 0 0 4 3 2 1
59
animation

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

}
return result;
}
list 1 2 3 4 5 6
result 0 0 4 3 2 1
60
animation

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

}
return result;
}
list 1 2 3 4 5 6
result 0 0 4 3 2 1
61
animation

int[] list1 = new int[]{1, 2, 3, 4, 5, 6};
i = 4 and j = 1

}
return result;
}
list 1 2 3 4 5 6
result 0 5 4 3 2 1
62
animation

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

}
return result;
}
list 1 2 3 4 5 6
result 0 5 4 3 2 1
63
animation

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

}
return result;
}
list 1 2 3 4 5 6
result 0 5 4 3 2 1
64
animation

int[] list1 = new int[]{1, 2, 3, 4, 5, 6};
i = 5 and j = 0

}
return result;
}
list 1 2 3 4 5 6
result 6 5 4 3 2 1
65
animation

int[] list1 = new int[]{1, 2, 3, 4, 5, 6};
public static int[] reverse(int[] list) { j becomes -1

}
return result;
}
list 1 2 3 4 5 6
result 6 5 4 3 2 1
66
animation

int[] list1 = new int[]{1, 2, 3, 4, 5, 6};
i (=6) < 6 is false. So exit
public static int[] reverse(int[] list) { the loop.

}
return result;
}
list 1 2 3 4 5 6
result 6 5 4 3 2 1
67
animation

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

}
return result;
}
list 1 2 3 4 5 6
list2
result 6 5 4 3 2 1
68
Example: Counting Occurrence of
Each Letter
 Generate 100 lowercase (a) Executing

createArray in Line 6
(b) After exiting
createArray in Line 6
letters randomly and assign Stack Heap Stack Heap
to an array of characters. Space required for the

createArray method
Array of 100 Array of 100
characters characters
char[] chars: ref
 Count the occurrence of each Space required for the

main method
Space required for the
main method
letter in the array. char[] chars: ref char[] chars: ref
CountLettersInArray Run
69
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. Searching is a common task in
computer programming. There are many algorithms and data
structures devoted to searching. In this section, two
commonly used approaches are discussed, linear search and
binary search.
public class LinearSearch {
/** 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]) [0] [1] [2] …
return i; list
return -1;
} key Compare key with list[i] for i = 0, 1, …
}
70
Linear Search
The linear search approach compares the key
element, key, sequentially with each element in
the array list. The method 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.
71
animation
Linear Search Animation

Key List
3 6 4 1 9 7 3 2 8
3 6 4 1 9 7 3 2 8
3 6 4 1 9 7 3 2 8
3 6 4 1 9 7 3 2 8
3 6 4 1 9 7 3 2 8
3 6 4 1 9 7 3 2 8
72
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;
}
Trace the method

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
73
Linear Search Applet
An applet was developed by a student to
visualize the steps for linear search Linear Search Applet
Linear Search source code LinearSearch
74
Binary Search
For binary search to work, the elements in the
array must already be ordered. Without loss of
generality, assume that the array is in
ascending order.
e.g., 2 4 7 10 11 45 50 59 60 66 69 70 79
The binary search first compares the key with
the element in the middle of the array.
75
Binary Search, cont.
Consider the following three cases:
 If the key is less than the middle element,
you only need to search the key in the first
half of the array.
 If the key is equal to the middle element,
the search ends with a match.
 If the key is greater than the middle
element, you only need to search the key in
the second half of the array.
76
animation
Binary Search
Key List
8 1 2 3 4 6 7 8 9
8 1 2 3 4 6 7 8 9
8 1 2 3 4 6 7 8 9
77
key is 11 low mid high
key < 50 [0] [1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12]
list 2 4 7 10 11 45 50 59 60 66 69 70 79
low mid high
[0] [1] [2] [3] [4] [5]

key > 7 list 2 4 7 10 11 45
low mid high
[3] [4] [5]

key == 11 list 10 11 45
78
key is 54 Binary
low Search,midcont. high
key > 50 [0] [1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12]
list 2 4 7 10 11 45 50 59 60 66 69 70 79
low mid high
[0] [1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12]
key < 66 list 59 60 66 69 70 79
low mid high
[7] [8]
key < 59 list 59 60
low high
[6] [7] [8]

59 60
79
The binarySearch method returns the index of the
search key if it is contained in the list. Otherwise,
it returns –insertion point - 1. The insertion point is
the point at which the key would be inserted into
the list.
80
From Idea to Soluton
/** Use binary search to find the key in the list */
public static int binarySearch(int[] list, int key) {
int low = 0;
int high = list.length - 1;
while (high >= low) {

int mid = (low + high) / 2;
if (key < list[mid])
high = mid - 1;
else if (key == list[mid])
return mid;
else
low = mid + 1;
}
return -1 - low;
}
81
Binary Search Applet
visualize the steps for binary search Binary Search Applet
Binary Search source code BinarySearch
82
The Arrays.binarySearch Method
Since binary search is frequently used in programming, Java provides several
overloaded binarySearch methods for searching a key in an array of int, double,
char, short, long, and float in the java.util.Arrays class. For example, the
following code searches the keys in an array of numbers and an array of
characters.
int[] list = {2, 4, 7, 10, 11, 45, 50, 59, 60, 66, 69, 70, 79};
System.out.println("Index is " +
java.util.Arrays.binarySearch(list, 11)); Return is 4
char[] chars = {'a', 'c', 'g', 'x', 'y', 'z'};

System.out.println("Index is " +
java.util.Arrays.binarySearch(chars, 't'));
Return is –4 (insertion point is
3, so return is -3-1)
For the binarySearch method to work, the array must be pre-sorted in increasing
order.
83
Sorting Arrays
Sorting, like searching, is also a common task in
computer programming. It would be used, for
instance, if you wanted to display the grades from
Listing 6.2, “Assigning Grades,” in alphabetical
order. Many different algorithms have been
developed for sorting. This section introduces two
simple, intuitive sorting algorithms: selection sort
and insertion sort.
84
swap
Selection Sort 2 9 5 4 8 1 6
Select 9 (the largest) and swap it

with 6 (the last) in the list swap
Selection sort finds the 2 6 5 4 8 1 9

The number 9 now is in the
correct position and thus no
longer need to be considered.
largest number in the Select 8 (the largest) and swap it
with 1 (the last) in the remaining
swap
list and places it last. It list
2 6 5 4 1 8 9
then finds the largest correct position and thus no
number remaining and Select 6 (the largest) and swap it

with 1 (the last) in the remaining swap
list
places it next to last, 2 1 5 4 6 8 9
and so on until the list Select 5 (the largest) and swap it


contains only a single list
number. Figure 6.17 2 1 4 5 6 8 9 correct position and thus no
shows how to sort the 4 is the largest and last in the list.
No swap is necessary swap
list {2, 9, 5, 4, 8, 1, 6} 2 1 4 5 6 8 9
using selection sort. Select 2 (the largest) and swap it

list
1 2 4 5 6 8 9 correct position and thus no
Since there is only one number in
the remaining list, sort is
completed
85
animation
Selection Sort
int[] myList = {2, 9, 5, 4, 8, 1, 6}; // Unsorted
2 9 5 4 8 1 6
2 6 5 4 8 1 9
2 6 5 4 1 8 9
2 1 5 4 6 8 9
2 1 4 5 6 8 9
2 1 4 5 6 8 9
1 2 4 5 6 8 9
86
From Idea to Solution
for (int i = list.length - 1; i >= 1; i--) {
select the largest element in list[0..i];
swap the largest with list[i], if necessary;
// list[i] is in place. The next iteration applies on list[0..i-1]
}
list[0] list[1] list[2] list[3] ... list[10]
...
list[0]
87
}
Expand
// Find the maximum in the list[0..i]
double currentMax = list[0];
int currentMaxIndex = 0;
for (int j = 1; j <= i; j++) {

if (currentMax < list[j]) {
currentMax = list[j];
currentMaxIndex = j;
}
}
88
}
Expand
int currentMaxIndex = 0;
for (int j = 1; j <= i; j++) {

}
}
89
}
Expand
// Swap list[i] with list[currentMaxIndex] if necessary;
if (currentMaxIndex != i) {
list[currentMaxIndex] = list[i];
list[i] = currentMax;
}
90
Wrap it in a Method
/** The method for sorting the numbers */
public static void selectionSort(double[] list) {
int currentMaxIndex = 0; Invoke it
for (int j = 1; j <= i; j++) { selectionSort(yourList)
}
}
// Swap list[i] with list[currentMaxIndex] if necessary;

if (currentMaxIndex != i) {
list[currentMaxIndex] = list[i];
list[i] = currentMax;
}
}
}
91
Selection Sort Applet
visualize the steps for selection sort Selection Sort Applet
Selection Sort source code SelectionSort
92
Optional
Insertion Sort
The insertion sort Step 1: Initially, the sorted sublist contains the 2 9 5 4 8 1 6
algorithm sorts a list first element in the list. Insert 9 to the sublist.
of values by
Step2: The sorted sublist is {2, 9}. Insert 5 to the 2 9 5 4 8 1 6
repeatedly inserting sublist.
an unsorted element
into a sorted sublist Step 3: The sorted sublist is {2, 5, 9}. Insert 4 to 2 5 9 4 8 1 6
the sublist.
until the whole list
is sorted. Step 4: The sorted sublist is {2, 4, 5, 9}. Insert 8 2 4 5 9 8 1 6
to the sublist.
Step 5: The sorted sublist is {2, 4, 5, 8, 9}. Insert 2 4 5 8 9 1 6

1 to the sublist.
Step 6: The sorted sublist is {1, 2, 4, 5, 8, 9}. 1 2 4 5 8 9 6

Insert 6 to the sublist.
Step 7: The entire list is now sorted 1 2 4 5 6 8 9
93
animation
Insertion Sort
2 9 5 4 8 1 6
2 9 5 4 8 1 6
2 5 9 4 8 1 6
2 4 5 9 8 1 6
2 4 5 8 9 1 6
1 2 4 5 8 9 6
1 2 4 5 6 8 9
94
Optional
How to Insert?
The insertion sort [0] [1] [2] [3] [4] [5] [6]
algorithm sorts a list list 2 5 9 4 Step 1: Save 4 to a temporary variable currentElement
of values by [0] [1] [2] [3] [4] [5] [6]

repeatedly inserting list 2 5 9 Step 2: Move list[2] to list[3]
an unsorted element [0] [1] [2] [3] [4] [5] [6]
into a sorted sublist list 2 5 9 Step 3: Move list[1] to list[2]
until the whole list
[0] [1] [2] [3] [4] [5] [6]
is sorted. list 2 4 5 9 Step 4: Assign currentElement to list[1]
95
Optional
Insertion Sort Applet
visualize the steps for selection sort Insertion Sort Applet
Selection Sort source code InsertionSort
96
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);
97
Optional
Exercise 6.14 Bubble Sort
The bubble-sort algorithm makes Iteration 1: 2, 5, 4, 8, 1, 6, 9

several iterations through the array. On
each iteration, successive neighboring Iteration 2: 2, 4, 5, 1, 6, 8, 9
pairs are compared. If a pair is in Iteration 3: 2, 4, 1, 5, 6, 8, 9
decreasing order, its values are Iteration 4: 2, 1, 4, 5, 6, 8, 9
swapped; otherwise, the values remain
unchanged. The technique is called a Iteration 5: 1, 2, 4, 5, 6, 8, 9
bubble sort or sinking sort because the Iteration 6: 1, 2, 4, 5, 6, 8, 9
smaller values gradually "bubble" their
way to the top and the larger values sink
to the bottom.
98
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];
99
Declaring Variables of Two-
dimensional Arrays and Creating
Two-dimensional Arrays
int[][] matrix = new int[10][10];
or
int 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);
double[][] x;
100
Two-dimensional Array Illustration
0 1 2 3 4 0 1 2 3 4 0 1 2
0 0 0 1 2 3
1 1 1 4 5 6
2 2 7 2 7 8 9
3 3 3 10 11 12
4 4 int[][] array = {
{1, 2, 3},
matrix = new int[5][5]; matrix[2][1] = 7; {4, 5, 6},
{7, 8, 9},
{10, 11, 12}
};
matrix.length? 5 array.length? 4
matrix[0].length? 5 array[0].length? 3
101
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 = {
int[][] array = new int[4][3];
{1, 2, 3}, array[0][0] = 1; array[0][1] = 2; array[0][2] = 3;
{4, 5, 6}, Same as array[1][0] = 4; array[1][1] = 5; array[1][2] = 6;
{7, 8, 9}, array[2][0] = 7; array[2][1] = 8; array[2][2] = 9;
{10, 11, 12} array[3][0] = 10; array[3][1] = 11; array[3][2] = 12;
};
102
Lengths of Two-dimensional
Arrays
int[][] x = new int[3][4];
x
x[0][0] x[0][1] x[0][2] x[0][3] x[0].length is 4
x[0]
x[1] x[1][0] x[1][1] x[1][2] x[1][3] x[1].length is 4
x[2]
x[2][0] x[2][1] x[2][2] x[2][3] x[2].length is 4
x.length is 3
103
Lengths of Two-dimensional
Arrays, cont.
int[][] array = { array.length
{1, 2, 3}, array[0].length
{10, 11, 12} array[3].length
};
array[4].length ArrayIndexOutOfBoundsException
104
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}, matrix.length is 5
{2, 3, 4, 5}, matrix[0].length is 5
matrix[1].length is 4
{3, 4, 5}, matrix[2].length is 3
{4, 5}, matrix[3].length is 2
{5} matrix[4].length is 1
};
105
Ragged Arrays, cont.
int[][] triangleArray = { 1 2 3 4 5
{1, 2, 3, 4, 5},
{2, 3, 4, 5}, 1 2 3 4
{3, 4, 5},
{4, 5}, 1 2 3
{5}
}; 1 2
1 2
106
Example: Grading Multiple-
Choice Test
 Objective: write a
Students’ Answers to the Questions:
0 1 2 3 4 5 6 7 8 9
program that grades
Student 0 A B A C C D E E A D multiple-choice test.
Student 1 D B A B C A E E A D
Student 2 E D D A C B E E A D
Student 3 C B A E D C E E A D Key to the Questions:
Student 4 A B D C C D E E A D 0 1 2 3 4 5 6 7 8 9
Student 5 B B E C C D E E A D
Student 6 B B A C C D E E A D Key D B D C C D A E A D
Student 7 E B E C C D E E A D
GradeExam Run
107
Example: Computing Taxes
Using Arrays
Listing 5.4, “Computing Taxes with Methods,” simplified
Listing 3.4, “Computing Taxes.” Listing 5.4 can be
further improved using arrays. Rewrite Listing 3.1 using
arrays to store tax rates and brackets.
ComputeTax Run
108
Refine the table
10% 6000 12000 6000 10000

15% 27950 46700 23350 37450
27% 67700 112850 56425 96745
30% 141250 171950 85975 156600
35% 307050 307050 153525 307050
38.6%
109
Reorganize the table
6000 12000 6000 10000
27950 46700 23350 37450
67700 112850 56425 96745
141250 171950 85975 156600
307050 307050 153525 307050
Rotate
6000 27950 67700 141250 307050 Single filer

12000 46700 112850 171950 307050 Married jointly
6000 23350 56425 85975 153525 Married separately
10000 37450 96745 156600 307050 Head of household
110
Declare Two Arrays
6000 27950 67700 141250 307050 Single filer
12000 46700 112850 171950 307050 Married jointly
6000 23350 56425 85975 153525 Married separately
10000 37450 96745 156600 307050 Head of household
10% int[][] brackets = {

{6000, 27950, 67700, 141250, 307050}, // Single filer
15%
{12000, 46700, 112850, 171950, 307050}, // Married jointly
27% {6000, 23350, 56425, 85975, 153525}, // Married separately
30% {10000, 37450, 96700, 156600, 307050} // Head of household
};
35%
38.6%
double[] rates = {0.10, 0.15, 0.27, 0.30, 0.35, 0.386};
111
Multidimensional Arrays
Occasionally, you will need to represent n-dimensional
data structures. In Java, you can create n-dimensional
arrays for any integer n.
The way to declare two-dimensional array variables and

create two-dimensional arrays can be generalized to
declare n-dimensional array variables and create n-
dimensional arrays for n >= 3. For example, the following
syntax declares a three-dimensional array variable scores,
creates an array, and assigns its reference to scores.
double[][][] scores = new double[10][5][2];
112
Example: Calculating Total Scores
 Objective: write a program that calculates the total score for

students in a class. Suppose the scores are stored in a three-
dimensional array named scores. The first index in scores refers to
a student, the second refers to an exam, and the third refers to the
part of the exam. Suppose there are 7 students, 5 exams, and each
exam has two parts--the multiple-choice part and the programming
part. So, scores[i][j][0] represents the score on the multiple-choice
part for the i’s student on the j’s exam. Your program displays the
total score for each student.
TotalScore Run
113
Introduction
• String and character processing

– Class java.lang.String
– Class java.lang.StringBuffer
– Class java.util.StringTokenizer
Funda menta ls of Cha ra cters a nd Strings
• Characters
– “Building blocks” of Java source programs
• String
– Series of characters treated as single unit
– May include letters, digits, etc.
– Object of class String
String Constructors
• Class String
– Provides nine constructors
1 // Fig. 11.1: StringConstructors.java
2 // String class constructors.
3 import javax.swing.*;
4 String defaultStringConstruct
constructor
5 public class StringConstructors {
6
ors.java
instantiates empty string
7 public static void main( String args[] )
8 { Constructor LineString
copies 17
9 char charArray[] = { 'b', 'i', 'r', 't', 'h', ' ', 'd', 'a', 'y' };
10 byte byteArray[] = { ( byte ) 'n', ( byte ) 'e',
Constructor Linecharacter
copies 18 array
11 ( byte ) 'w', ( byte ) ' ', ( byte ) 'y',
12 ( byte ) 'e', ( byte ) 'a', ( byte ) 'r' };
13 Line 19
Constructor copies
14 String s = new String( "hello" );
15 character-array subset
Line 20
16 // use String constructors
17 String s1 = new String();
18 String s2 = new String( s ); Line
Constructor copies 21array
byte
19 String s3 = new String( charArray );
20 String s4 = new String( charArray, 6, 3 ); Line 22
21 String s5 = new String( byteArray, 4, 4 );
Constructor copies byte-array subset
22 String s6 = new String( byteArray );
23
24 // append Strings to output
25 String output = "s1 = " + s1 + "\ns2 = " + s2 + "\ns3 = " + s3 +
26 "\ns4 = " + s4 + "\ns5 = " + s5 + "\ns6 = " + s6; StringConstruct
27
28 JOptionPane.showMessageDialog( null, output,
ors.java
29 "String Class Constructors", JOptionPane.INFORMATION_MESSAGE );
30
31 System.exit( 0 );
32 }
33
34 } // end class StringConstructors
String Methods length, charAt a nd
getChars
• Method length
– Determine String length
• Like arrays, Strings always “know” their size
• Unlike array, Strings do not have length instance variable
• Method charAt
– Get character at specific location in String
• Method getChars
– Get entire set of characters in String
1 // Fig. 11.2: StringMiscellaneous.java
2 // This program demonstrates the length, charAt and getChars
3 // methods of the String class.
4 import javax.swing.*; StringMiscellan
5
6 public class StringMiscellaneous {
eous.java
7
8 public static void main( String args[] ) Line 16
9 {
10 String s1 = "hello there";
Line 21
11 char charArray[] = new char[ 5 ];
12
13 String output = "s1: " + s1;
14
15 // test length method
Determine number of
16 output += "\nLength of s1: " + s1.length();
17
characters in String s1
18 // loop through characters in s1 and display reversed
19 output += "\nThe string reversed is: ";
20 Append s1’s characters
21 for ( int count = s1.length() - 1; count >= 0; count-- )
in reverse order to
22 output += s1.charAt( count ) + " ";
String output
23
24 // copy characters from string into charArray
Copy (some of) s1’s
25 s1.getChars( 0, 5, charArray, 0 );
26 output += "\nThe character array is: "; characters to charArray
StringMiscellan
27
28 for ( int count = 0; count < charArray.length; count++ )
eous.java
29 output += charArray[ count ];
30 Line 25
32 "String class character manipulation methods",
33 JOptionPane.INFORMATION_MESSAGE );
34
36 }
37
38 } // end class StringMiscellaneous
Compa ring Strings
• Comparing String objects

– Method equals
– Method equalsIgnoreCase
– Method compareTo
– Method regionMatches
1 // Fig. 11.3: StringCompare.java
2 // String methods equals, equalsIgnoreCase, compareTo and regionMatches.
3 import javax.swing.JOptionPane;
4 StringCompare.j
5 public class StringCompare {
6
ava
8 { Line 18
9 String s1 = new String( "hello" ); // s1 is a copy of "hello"
10 String s2 = "goodbye";
Line 24
11 String s3 = "Happy Birthday";
12 String s4 = "happy birthday";
13
14 String output = "s1 = " + s1 + "\ns2 = " + s2 + "\ns3 = " + s3 +
15 "\ns4 = " + s4 + "\n\n";
16
Method equals tests two
17 // test for equality
18 if ( s1.equals( "hello" ) ) // true objects for equality using
19 output += "s1 equals \"hello\"\n"; lexicographical comparison
20 else
21 output += "s1 does not equal \"hello\"\n";
22
23 // test for equality with ==
Equality operator (==) tests
24 if ( s1 == "hello" ) // false; they are not theifsame
bothobject
references refer to
25 output += "s1 equals \"hello\"\n"; same object in memory
26 else
27 output += "s1 does not equal \"hello\"\n";
28
29 // test for equality (ignore case) Test two objects for
30 if ( s3.equalsIgnoreCase( s4 ) ) // true equality, but ignore case
31 output += "s3 equals s4\n"; StringCompare.j
of letters in Strings
32 else
33 output += "s3 does not equal s4\n";
ava
34
35 // test compareTo Line 30
36 output += "\ns1.compareTo( s2 ) is " + s1.compareTo( s2 ) +
Method compareTo
37 "\ns2.compareTo( s1 ) is " + s2.compareTo( s1 ) + compares String objects
Lines 36-40
38 "\ns1.compareTo( s1 ) is " + s1.compareTo( s1 ) +
39 "\ns3.compareTo( s4 ) is " + s3.compareTo( s4 ) +
40 "\ns4.compareTo( s3 ) is " + s4.compareTo( s3 ) + "\n\n"; Line 43 and 49
41
42 // test regionMatches (case sensitive) Method regionMatches
43 if ( s3.regionMatches( 0, s4, 0, 5 ) ) compares portions of two
44 output += "First 5 characters of s3 and s4 match\n"; String objects for equality
45 else
46 output += "First 5 characters of s3 and s4 do not match\n";
47
48 // test regionMatches (ignore case)
49 if ( s3.regionMatches( true, 0, s4, 0, 5 ) )
50 output += "First 5 characters of s3 and s4 match";
51 else
52 output += "First 5 characters of s3 and s4 do not match";
53
55 "String comparisons", JOptionPane.INFORMATION_MESSAGE );
56 StringCompare.j
58 }
ava
59
60 } // end class StringCompare
1 // Fig. 11.4: StringStartEnd.java
2 // String methods startsWith and endsWith.
4 StringStartEnd.
5 public class StringStartEnd {
6
java
8 { Line 15
9 String strings[] = { "started", "starting", "ended", "ending" };
10 String output = "";
Line 24
11
12 // test method startsWith
13 for ( int count = 0; count < strings.length; count++ )
14
15 if ( strings[ count ].startsWith( "st" ) )
16 output += "\"" + strings[ count ] + "\" starts with \"st\"\n";
17
18 output += "\n";
Method startsWith
19
20 // test method startsWith starting from position
determines if String starts
21 // 2 of the string with specified characters
23
24 if ( strings[ count ].startsWith( "art", 2 ) )
25 output += "\"" + strings[ count ] +
26 "\" starts with \"art\" at position 2\n";
27
28 output += "\n";
29
30 // test method endsWith StringStartEnd.
32
java
33 if ( strings[ count ].endsWith( "ed" ) )
34 output += "\"" + strings[ count ] + "\" ends with \"ed\"\n"; Line 33
35
Method endsWith
37 determines);if
"String Class Comparisons", JOptionPane.INFORMATION_MESSAGE String ends
38 with specified characters
40 }
41
42 } // end class StringStartEnd
Loca ting Cha ra cters a nd Substrings in
Strings
• Search for characters in String
– Method indexOf
– Method lastIndexOf
1 // Fig. 11.5: StringIndexMethods.java
2 // String searching methods indexOf and lastIndexOf.
4 StringIndexMeth
5 public class StringIndexMethods {
6
ods.java
8 { Lines 12-16
9 String letters = "abcdefghijklmabcdefghijklm";
10
Lines 19-26
11 // test indexOf to locate a character in a string
12 Method
String output = "'c' is located at index " + letters.indexOf( 'c' ); indexOf finds first
13 occurrence of character in String
14 output += "\n'a' is located at index " + letters.indexOf( 'a', 1 );
15
16 output += "\n'$' is located at index " + letters.indexOf( '$' );
17
18 // test lastIndexOf to find a character in a string
19 output += "\n\nLast 'c' is located at index " +
20 letters.lastIndexOf( 'c' );
21
22 output += "\nLast 'a' is located at index " + Method lastIndexOf
23 letters.lastIndexOf( 'a', 25 );
finds last occurrence of
24
25 output += "\nLast '$' is located at index " +
character in String
26 letters.lastIndexOf( '$' );
27
28 // test indexOf to locate a substring in a string
29 output += "\n\n\"def\" is located at index " +
30 letters.indexOf( "def" );
31 StringIndexMeth
32 output += "\n\"def\" is located at index " +
33 letters.indexOf( "def", 7 );
ods.java
34
35 output += "\n\"hello\" is located at index " + Lines 29-46
36 letters.indexOf( "hello" ); Methods indexOf and
37
lastIndexOf can also find
38 // test lastIndexOf to find a substring in a string
39 output += "\n\nLast \"def\" is located at index " +
occurrences of substrings
40 letters.lastIndexOf( "def" );
41
42 output += "\nLast \"def\" is located at index " +
43 letters.lastIndexOf( "def", 25 );
44
45 output += "\nLast \"hello\" is located at index " +
46 letters.lastIndexOf( "hello" );
47
49 "String searching methods", JOptionPane.INFORMATION_MESSAGE );
50
52 }
53
54 } // end class StringIndexMethods
StringIndexMeth
ods.java
Extra cting Substrings from Strings
• Create Strings from other Strings

– Method substring
1 // Fig. 11.6: SubString.java
2 // String class substring methods.
4 SubString.java
5 public class SubString {
6
7 public static void main( String args[] ) Line 13
8 {
9 String letters = "abcdefghijklmabcdefghijklm"; Line 16
10
11 // test substring methods Beginning at index 20,
12 String output = "Substring from index 20 to end is " + extract characters from
13 "\"" + letters.substring( 20 ) + "\"\n"; String letters
14
15 output += "Substring from index 3 up to 6 is " +
16 "\"" + letters.substring( 3, 6 ) + "\""; Extract characters from index 3
17 to 6 from String letters
19 "String substring methods", JOptionPane.INFORMATION_MESSAGE );
20
22 }
23
24 } // end class SubString
Conca tena ting Strings
• Method concat
– Concatenate two String objects
1 // Fig. 11.7: StringConcatenation.java
2 // String concat method.
4 StringConcatena
5 public class StringConcatenation {
6
tion.java
8 { Line 14
9 String s1 = new String( "Happy " );
10 String s2 = new String( "Birthday" );
Concatenate String s2
to String s1Line 15
11
12 String output = "s1 = " + s1 + "\ns2 = " + s2;
13
14 output += "\n\nResult of s1.concat( s2 ) = " + s1.concat( s2 );
15 output += "\ns1 after concatenation = " + s1;
16 However, String s1 is not
17 JOptionPane.showMessageDialog( null, output, modified by method concat
18 "String method concat", JOptionPane.INFORMATION_MESSAGE );
19
21 }
22
23 } // end class StringConcatenation
Miscella neous String Methods
• Miscellaneous String methods

– Return modified copies of String
– Return character array
1 // Fig. 11.8: StringMiscellaneous2.java
2 // String methods replace, toLowerCase, toUpperCase, trim and toCharArray.
4 StringMiscellan
5 public class StringMiscellaneous2 {
6
eous2.java
8 { Line 17
9 String s1 = new String( "hello" );
Use method replace to return s1
10 String s2 = new String( "GOODBYE" ); copy in which every occurrence of
Line 20
11 String s3 = new String( " spaces " ); ‘l’ is replaced with ‘L’
12
13 Use
String output = "s1 = " + s1 + "\ns2 = " + s2 + "\ns3 = " method
+ s3; Line 21 to
toUpperCase
14 return s1 copy in which every
15 // test method replace Line 24
character is uppercase
16 output += "\n\nReplace 'l' with 'L' in s1: " +
17 s1.replace( 'l', 'L' );
18
Use method toLowerCase to
19 // test toLowerCase and toUpperCase return s2 copy in which every
20 output += "\n\ns1.toUpperCase() = " + s1.toUpperCase() + character is uppercase
21 "\ns2.toLowerCase() = " + s2.toLowerCase();
22 Use method trim to
23 // test trim method
return s3 copy in which
24 output += "\n\ns3 after trim = \"" + s3.trim() + "\"";
25
whitespace is eliminated
26 // test toCharArray method
Use method toCharArray to
27 char charArray[] = s1.toCharArray();
28 output += "\n\ns1 as a character array = ";
return character array of s1
29 StringMiscellan
30 for ( int count = 0; count < charArray.length; ++count )
eous2.java
32
33 JOptionPane.showMessageDialog( null, output, Line 27
34 "Additional String methods", JOptionPane.INFORMATION_MESSAGE );
35
37 }
38
39 } // end class StringMiscellaneous2
String Method valueOf
• String provides static class methods

– Method valueOf
• Returns String representation of object, data, etc.
1 // Fig. 11.9: StringValueOf.java
2 // String valueOf methods.
4 StringValueOf.j
5 public class StringValueOf {
6
ava
8 { Lines 20-26
9 char charArray[] = { 'a', 'b', 'c', 'd', 'e', 'f' };
10 boolean booleanValue = true;
11 char characterValue = 'Z';
12 int integerValue = 7;
13 long longValue = 10000000L;
14 float floatValue = 2.5f; // f suffix indicates that 2.5 is a float
15 double doubleValue = 33.333;
16 Object objectRef = "hello"; // assign string to an Object reference
17
18 String output = "char array = " + String.valueOf( charArray ) +
19 "\npart of char array = " + String.valueOf( charArray, 3, 3 ) +
20 "\nboolean = " + String.valueOf( booleanValue ) +
21 "\nchar = " + String.valueOf( characterValue ) +
22 "\nint = " + String.valueOf( integerValue ) + static method valueOf of
23 "\nlong = " + String.valueOf( longValue ) + class String returns String
24 "\nfloat = " + String.valueOf( floatValue ) + representation of various types
25 "\ndouble = " + String.valueOf( doubleValue ) +
26 "\nObject = " + String.valueOf( objectRef );
27
29 "String valueOf methods", JOptionPane.INFORMATION_MESSAGE );
30 StringValueOf.j
32 }
ava
33
34 } // end class StringValueOf
Cla ss StringBuffer
• Class StringBuffer
– When String object is created, its contents cannot change
– Used for creating and manipulating dynamic string data
• i.e., modifiable Strings
– Can store characters based on capacity
• Capacity expands dynamically to handle additional characters
– Uses operators + and += for String concatenation
StringBuffer Constructors
• Three StringBuffer constructors

– Default creates StringBuffer with no characters
• Capacity of 16 characters
1 // Fig. 11.10: StringBufferConstructors.java
2 // StringBuffer constructors. Default constructor creates
3 import javax.swing.*; empty StringBuffer with
4
capacity of StringBufferCon
16 characters
5 public class StringBufferConstructors {
6
structors.java
Second constructor creates empty
8 { Line 9
9 StringBuffer buffer1 = new StringBuffer();
StringBuffer with capacity of
10 StringBuffer buffer2 = new StringBuffer( 10 ); specified (10) characters
Line 10
11 StringBuffer buffer3 = new StringBuffer( "hello" );
12 Third constructor creates
13 String output = "buffer1 = \"" + buffer1.toString() + "\"" + Line 11
StringBuffer with
14 "\nbuffer2 = \"" + buffer2.toString() + "\"" +
15 "\nbuffer3 = \"" + buffer3.toString() + "\""; String “hello” and
Lines 13-15
16 capacity of 16 characters
18 "StringBuffer constructors", JOptionPane.INFORMATION_MESSAGE Method
); toString returns
19
String representation of
21 } StringBuffer
22
23 } // end class StringBufferConstructors
StringBuffer Methods length, capacity,
setLength a nd ensureCapacity
• Method length
– Return StringBuffer length
• Method capacity
– Return StringBuffer capacity
• Method setLength
– Increase or decrease StringBuffer length
• Method ensureCapacity
– Set StringBuffer capacity
– Guarantee that StringBuffer has minimum capacity
1 // Fig. 11.11: StringBufferCapLen.java
2 // StringBuffer length, setLength, capacity and ensureCapacity methods.
4 StringBufferCap
5 public class StringBufferCapLen {
6
Len.java
8 { Method length
Line 12 returns
9 StringBuffer buffer = new StringBuffer( "Hello, how are you?" ); StringBuffer length
10
Line 12
11 String output = "buffer = " + buffer.toString() + "\nlength = " +
12 buffer.length() + "\ncapacity = " + buffer.capacity();
Method capacity returns
13 StringBuffer
Line 14 capacity
14 buffer.ensureCapacity( 75 );
15 output += "\n\nNew capacity = " + buffer.capacity(); Line 17
Use method ensureCapacity
16
17 buffer.setLength( 10 );
to set capacity to 75
18 output += "\n\nNew length = " + buffer.length() +
19 "\nbuf = " + buffer.toString(); Use method setLength
20 to set length to 10
22 "StringBuffer length and capacity Methods",
24
26 }
27
28 } // end class StringBufferCapLen StringBufferCap
Len.java
Only 10 characters
from
StringBuffer are
printed
Only 10 characters from

StringBuffer are printed
StringBuffer Methods charAt,
setCharAt, getChars a nd reverse
• Manipulating StringBuffer characters
– Method charAt
• Return StringBuffer character at specified index
– Method setCharAt
• Set StringBuffer character at specified index
– Method getChars
• Return character array from StringBuffer
– Method reverse
• Reverse StringBuffer contents
1 // Fig. 11.12: StringBufferChars.java
2 // StringBuffer methods charAt, setCharAt, getChars and reverse.
4 StringBufferCha
5 public class StringBufferChars {
6
rs.java
8 { Lines 12-13
9 StringBuffer buffer = new StringBuffer( "hello there" );
Return StringBuffer
10 characters at indices 0
Line 16
11 String output = "buffer = " + buffer.toString() + and 4, respectively
12 "\nCharacter at 0: " + buffer.charAt( 0 ) +
13 "\nCharacter at 4: " + buffer.charAt( 4 ); Lines 22-23
14
15 char charArray[] = new char[ buffer.length() ]; Return character array
16 buffer.getChars( 0, buffer.length(), charArray, 0 );
17 output += "\n\nThe characters are: ";
from StringBuffer
18
19 for ( int count = 0; count < charArray.length; ++count )
21
22 buffer.setCharAt( 0, 'H' ); Replace characters at
23 buffer.setCharAt( 6, 'T' ); indices 0 and 6 with ‘H’
24 output += "\n\nbuf = " + buffer.toString(); and ‘T,’ respectively
25
26 buffer.reverse();
27 output += "\n\nbuf = " + buffer.toString();
Reverse characters in
28
StringBuffer
StringBufferCha
30 "StringBuffer character methods",
rs.java
32
33 System.exit( 0 ); Lines 26
34 }
35
36 } // end class StringBufferChars
StringBuffer append Methods
• Method append
– Allow data values to be added to StringBuffer
1 // Fig. 11.13: StringBufferAppend.java
2 // StringBuffer append methods.
4 StringBufferApp
5 public class StringBufferAppend {
6
end.java
8 { Line 21
9 Object objectRef = "hello";
10 String string = "goodbye";
Line 23
13 char characterValue = 'Z'; Line 25
15 long longValue = 10000000; Line 27
16 float floatValue = 2.5f; // f suffix indicates 2.5 is a float
18 StringBuffer lastBuffer = new StringBuffer( "last StringBuffer" );
19 StringBuffer buffer = new StringBuffer();
20 Append String “hello”
21 buffer.append( objectRef );
22 buffer.append( " " );
to StringBuffer
// each of these contains two spaces
23 buffer.append( string );
24 buffer.append( " " ); Append String “goodbye”
25 buffer.append( charArray );
26 buffer.append( " " ); Append “a b c d e f”
27 buffer.append( charArray, 0, 3 );
Append “a b c”
29 buffer.append( booleanValue );
31 buffer.append( characterValue ); StringBufferApp
Append boolean, char, int,
end.java
33 buffer.append( integerValue );
34 buffer.append( " " ); long, float and double
35 buffer.append( longValue ); Line 29-39
37 buffer.append( floatValue );
39 buffer.append( doubleValue );
41 buffer.append( lastBuffer );
42
43 JOptionPane.showMessageDialog( null,
44 "buffer = " + buffer.toString(), "StringBuffer append Methods",
46
48 }
49
50 } // end StringBufferAppend
StringBuffer Insertion a nd Deletion
Methods
• Method insert
– Allow data-type values to be inserted into StringBuffer
• Methods delete and deleteCharAt
– Allow characters to be removed from StringBuffer
1 // Fig. 11.14: StringBufferInsert.java
2 // StringBuffer methods insert and delete.
4 StringBufferIns
5 public class StringBufferInsert {
6
ert.java
8 { Lines 20-26
9 Object objectRef = "hello";
10 String string = "goodbye";
13 char characterValue = 'K';
15 long longValue = 10000000;
16 float floatValue = 2.5f; // f suffix indicates that 2.5 is a float
18 StringBuffer buffer = new StringBuffer();
19
20 buffer.insert( 0, objectRef );
21 buffer.insert( 0, " " ); // each of these contains two spaces
22 buffer.insert( 0, string );
23 buffer.insert( 0, " " );
24 buffer.insert( 0, charArray ); Use method insert to insert
25 buffer.insert( 0, " " ); data in beginning of
26 buffer.insert( 0, charArray, 3, 3 ); StringBuffer
28 buffer.insert( 0, booleanValue );
30 buffer.insert( 0, characterValue );
31 buffer.insert( 0, " " ); Use method insert to insertStringBufferIns
32 buffer.insert( 0, integerValue ); data in beginning of ert.java
33 buffer.insert( 0, " " ); StringBuffer
34 buffer.insert( 0, longValue ); Lines 27-38
36 buffer.insert( 0, floatValue );
Line 42
38 buffer.insert( 0, doubleValue ); Use method deleteCharAt to
39 Lineindex
remove character from 43 10 in
40 String output = "buffer after inserts:\n" + buffer.toString(); StringBuffer
41
42 buffer.deleteCharAt( 10 ); // delete 5 in 2.5
43 buffer.delete( 2, 6 ); // delete .333 in 33.333
44 Remove characters from
45 output += "\n\nbuffer after deletes:\n" + buffer.toString(); indices 2 through 5 (inclusive)
46
48 "StringBuffer insert/delete", JOptionPane.INFORMATION_MESSAGE );
49
51 }
52
53 } // end class StringBufferInsert
StringBufferIns
ert.java
Cla ss StringTokenizer
• Tokenizer
– Partition String into individual substrings
– Use delimiter
– Java offers java.util.StringTokenizer

JAva Array

Încărcat de

Informații document

Titlu original

Drepturi de autor

Formate disponibile

Partajați acest document

Partajați sau inserați document

Opțiuni de partajare

Vi se pare util acest document?

Este necorespunzător acest conținut?

Drepturi de autor:

Formate disponibile

JAva Array

Încărcat de

Drepturi de autor:

Formate disponibile

Chapter 6 Arrays

Basic computer skills such as using Windows,

Chapter 1 Introduction to Computers, Programs,

Chapter 2 Primitive Data Types and Operations

Chapter 3 Selection Statements

Chapter 5 Methods §§19.1-19.3 in Chapter 19 Recursion

Chapter 6 Arrays Chapter 23 Algorithm Efficiency and Sorting

Array reference myList[2] 3.3

 datatype arrayRefVar[]; // This style is

myList[0] references the first element in the array.

 datatype arrayRefVar[] = new

0 for the numeric primitive data types,

Each element in the array is represented using the

myList[2] = myList[0] + myList[1];

This shorthand syntax must be in one

This shorthand notation is equivalent to the

myList = {1.9, 2.9, 3.4, 3.5};

public class Test {

int[] values = new int[5]; 0 0

values[0] = values[1] + values[4]; 4 0

public class Test {

values[i] = values[i] + values[i-1]; 1 0

public class Test {

values[0] = values[1] + values[4]; 3 0

public class Test {

int[] values = new int[5]; 0 0

values[0] = values[1] + values[4]; 4 0

Trace Program with Arrays

public class Test {

for (int i = 1; i < 5; i++) {

values[i] = values[i] + values[i-1];

public class Test {

int[] values = new int[5]; 0 0

values[0] = values[1] + values[4]; 4 0

public class Test {

int[] values = new int[5]; 0 0

values[0] = values[1] + values[4]; 4 0

public class Test {

int[] values = new int[5]; 0 0

values[0] = values[1] + values[4]; 4 0

public class Test {

int[] values = new int[5]; 0 0

values[0] = values[1] + values[4]; 4 0

public class Test {

int[] values = new int[5]; 0 0

values[0] = values[1] + values[4]; 4 0

public class Test {

int[] values = new int[5]; 0 0

values[0] = values[1] + values[4]; 4 0

public class Test {

int[] values = new int[5]; 0 0

values[0] = values[1] + values[4]; 4 10

public class Test {

Trace Program with Arrays

public class Test {

public class Test {

values[0] = values[1] + values[4]; 3 6

for (double value: myList)

In general, the syntax is

for (elementType value: arrayRefVar) {

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

Invoke the method

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