06slide

Liang, Introduction to Java Programming, Ninth Edition, (c) 2013 Pearson Education, Inc. All
rights reserved.
1
Chapter 6 Arrays

rights reserved.
2
Opening Problem
Read one hundred numbers, compute their
average, and find out how many numbers are
above the average.

rights reserved.
3
Solution
AnalyzeNumbers Run
Run with prepared input

rights reserved.
4
Objectives
 To describe why arrays are necessary in programming (§6.1).
 To declare array reference variables and create arrays (§§6.2.1–6.2.2).
 To initialize obtain array size using arrayRefVar.length and know default the values in
an array (§6.2.3).
 To access array elements using indexed variables (§6.2.4).
 To declare, create, and initialize an array using an array initializer (§6.2.5).
 To program common array operations (displaying arrays, summing all elements,
finding the minimum and maximum elements, random shuffling, and shifting elements)
(§6.2.6).
 To simplify programming using the for-eachfor-each loops (§6.2.7).
 To apply arrays in the application development (LottoNumbers, DeckOfCards)
(§§6.3–6.4).
 To copy contents from one array to another (§6.5).
 To develop and invoke methods with array arguments and return values (§§6.6–6.78).
 To define a method with a variable-length argument list (§6.89).
 To search elements using the linear (§6.910.1) or binary (§6.910.2) search algorithm.
 To sort an array using the selection sort approach (§6.1011.1).
 To sort an array using the insertion sort approach (§6.1011.2).
 To use the methods in the java.util.Arrays class (§6.1112).

rights reserved.
5
Introducing Arrays
Array is a data structure that represents a collection of the
same types of data.
5.6
4.5
3.3
13.2
4
34.33
34
45.45
99.993
11123
double[] myList = new double[10];
myList reference
myList[0]
myList[1]
myList[2]
myList[3]
myList[4]
myList[5]
myList[6]
myList[7]
myList[8]
myList[9]
Element value
Array reference
variable
Array element at
index 5

rights reserved.
6
Declaring Array Variables
 datatype[] arrayRefVar;
Example:
double[] myList;
 datatype arrayRefVar[]; // This style is
allowed, but not preferred
Example:
double myList[];

rights reserved.
7
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.

rights reserved.
8
Declaring and Creating
in One Step
 datatype[] arrayRefVar = new
datatype[arraySize];
 datatype arrayRefVar[] = new
datatype[arraySize];
double myList[] = new double[10];

rights reserved.
9
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

rights reserved.
10
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.

rights reserved.
11
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];

rights reserved.
12
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];

rights reserved.
13
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.

rights reserved.
14
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;

rights reserved.
15
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};

rights reserved.
16
Trace Program with Arrays
public class Test {
public static void main(String[] args) {
int[] values = new int[5];
for (int i = 1; i < 5; i++) {
values[i] = i + values[i-1];
}
values[0] = values[1] + values[4];
}
}
Declare array variable values, create an
array, and assign its reference to values
After the array is created
0
1
2
3
4
0
0
0
0
0
animation

rights reserved.
17
public class Test {
for (int i = 1; i < 5; i++) {
}
}
}
i becomes 1
0
1
2
3
4
0
0
0
0
0
animation

rights reserved.
18
public class Test {
for (int i = 1; i < 5; i++) {
}
}
}
i (=1) is less than 5
0
1
2
3
4
0
0
0
0
0
animation

rights reserved.
19
public class Test {
for (int i = 1; i < 5; i++) {
}
}
}
After this line is executed, value[1] is 1
After the first iteration
0
1
2
3
4
0
1
0
0
0
animation

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

rights reserved.
21
public class Test {
public static void main(String[]
args) {
for (int i = 1; i < 5; i++) {
}
values[0] = values[1] +
values[4];
}
}
i (= 2) is less than 5
animation
0
1
2
3
4
0
1
0
0
0

rights reserved.
22
public class Test {
for (int i = 1; i < 5; i++) {
}
}
}
After this line is executed,
values[2] is 3 (2 + 1)
After the second iteration
0
1
2
3
4
0
1
3
0
0
animation

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

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

rights reserved.
25
public class Test {
for (int i = 1; i < 5; i++) {
}
}
}
After this line, values[3] becomes 6 (3 + 3)
After the third iteration
0
1
2
3
4
0
1
3
6
0
animation

rights reserved.
26
public class Test {
for (int i = 1; i < 5; i++) {
}
}
}
After this, i becomes 4
0
1
2
3
4
0
1
3
6
0
animation

rights reserved.
27
public class Test {
for (int i = 1; i < 5; i++) {
}
}
}
i (=4) is still less than 5
0
1
2
3
4
0
1
3
6
0
animation

rights reserved.
28
public class Test {
for (int i = 1; i < 5; i++) {
}
}
}
After this, values[4] becomes 10 (4 + 6)
After the fourth iteration
0
1
2
3
4
0
1
3
6
10
animation

rights reserved.
29
public class Test {
public static void main(String[] args)
{
for (int i = 1; i < 5; i++) {
}
}
}
After i++, i becomes 5
animation
0
1
2
3
4
0
1
3
6
10

rights reserved.
30
public class Test {
for (int i = 1; i < 5; i++) {
}
}
}
i ( =5) < 5 is false. Exit the loop
animation
0
1
2
3
4
0
1
3
6
10

rights reserved.
31
public class Test {
for (int i = 1; i < 5; i++) {
}
}
}
After this line, values[0] is 11 (1 + 10)
0
1
2
3
4
11
1
3
6
10
animation

rights reserved.
32
Processing Arrays
See the examples in the text.
1. (Initializing arrays with input values)
2. (Initializing arrays with random values)
3. (Printing arrays)
4. (Summing all elements)
5. (Finding the largest element)
6. (Finding the smallest index of the largest element)
7. (Random shuffling)
8. (Shifting elements)

rights reserved.
33
Initializing arrays with input values
java.util.Scanner input = new java.util.Scanner(System.in);
System.out.print("Enter " + myList.length + " values: ");
for (int i = 0; i < myList.length; i++)
myList[i] = input.nextDouble();

rights reserved.
34
Initializing arrays with random values
for (int i = 0; i < myList.length; i++) {
myList[i] = Math.random() * 100;
}

rights reserved.
35
Printing arrays
System.out.print(myList[i] + " ");
}

rights reserved.
36
Summing all elements
double total = 0;
total += myList[i];
}

rights reserved.
37
Finding the largest element
double max = myList[0];
if (myList[i] > max) max = myList[i];
}

rights reserved.
38
Random shuffling
// Generate an index j randomly
int index = (int)(Math.random()
* myList.length);
// Swap myList[i] with myList[index]
double temp = myList[i];
myList[i] = myList[index];
myList[index] = temp;
}
myList
[0]
[1]
.
.
.
[index]
A random index
i
swap

rights reserved.
39
Shifting Elements
double temp = myList[0]; // Retain the first element
// Shift elements left
myList[i - 1] = myList[i];
}
// Move the first element to fill in the last position
myList[myList.length - 1] = temp;
myList

rights reserved.
40
Enhanced for Loop (for-each 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.

rights reserved.
41
Problem: Lotto Numbers
Suppose you play the Pick-10 lotto. Each ticket has
10 unique numbers ranging from 1 to 99. You buy
a lot of tickets. You like to have your tickets to
cover all numbers from 1 to 99. Write a program
that reads the ticket numbers from a file and checks
whether all numbers are covered. Assume the last
number in the file is 0.
LottoNumbers Run
Lotto Numbers Sample Data

rights reserved.
42
Problem: Lotto Numbers
false
false
false
false
.
.
.
false
false
isCovered
[0]
[1]
[2]
[3]
[98]
(a)
[97]
true
false
false
false
.
.
.
false
false
isCovered
[0]
[1]
[2]
[3]
[98]
(b)
[97]
true
true
false
false
.
.
.
false
false
isCovered
[0]
[1]
[2]
[3]
[98]
(c)
[97]
true
true
true
false
.
.
.
false
false
isCovered
[0]
[1]
[2]
[3]
[98]
(d)
[97]
true
true
true
false
.
.
.
false
true
isCovered
[0]
[1]
[2]
[3]
[98]
(e)
[97]

rights reserved.
43
Problem: Deck of Cards
The problem is to write a program that picks four cards
randomly from a deck of 52 cards. All the cards can be
represented using an array named deck, filled with initial
values 0 to 51, as follows:
DeckOfCards Run
int[] deck = new int[52];
// Initialize cards
for (int i = 0; i < deck.length; i++)
deck[i] = i;

rights reserved.
44
Problem: Deck of Cards, cont.
0
.
.
.
12
13
.
.
.
25
26
.
.
.
38
39
.
.
.
51
13 Spades (♠)
13 Hearts (♥)
13 Diamonds (♦)
13 Clubs (♣)
0
.
.
.
12
13
.
.
.
25
26
.
.
.
38
39
.
.
.
51
deck
[0]
.
.
.
[12]
[13]
.
.
.
[25]
[26]
.
.
.
[38]
[39]
.
.
.
[51]
Random shuffle
6
48
11
24
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
deck
[0]
[1]
[2]
[3]
[4]
[5]
.
.
.
[25]
[26]
.
.
.
[38]
[39]
.
.
.
[51]
Card number 6 is the
7 (6 % 13 = 6) of
Spades (7 / 13 is 0)
10 (48 % 13 = 9) of
Clubs (48 / 13 is 3)
Queen (11 % 13 = 11) of
Spades (11 / 13 is 0)
Queen (24 % 13 = 11) of
Hearts (24 / 13 is 1)

rights reserved.
45
Problem: Deck of Cards, cont.
DeckOfCards Run
GUI Demo (picking four cards)
cardNumber / 13 =
0 Spades
1 Hearts
2 Diamonds
3 Clubs
cardNumber % 13 =
0 Ace
1 2
.
.
10 Jack
11 Queen
12 King

rights reserved.
46
Problem: Deck of Cards
This problem builds a foundation for future more interesting and
realistic applications:
See Exercise 22.15.
Run 24 Point Game

rights reserved.
47
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;
Contents
of list1
list1
Contents
of list2
list2
Before the assignment
list2 = list1;
Contents
of list1
list1
Contents
of list2
list2
After the assignment
list2 = list1;
Garbage

rights reserved.
48
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.
49
The arraycopy Utility
arraycopy(sourceArray, src_pos,
targetArray, tar_pos, length);
Example:
System.arraycopy(sourceArray, 0,
targetArray, 0, sourceArray.length);

rights reserved.
50
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.
51
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.

rights reserved.
52
Pass By Value
Java 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.
53
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]
}
}
Simple Example

rights reserved.
54
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.
Space required for the
main method
int[] y:
int x: 1
Stack
Space required for
method m
int[] numbers:
int number: 1
reference
0
0
0
The arrays are
stored in a
heap.
Heap
reference
Array of
ten int
values is

rights reserved.
55
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.
main method
int[] y:
int x: 1
Stack
Space required for
method m
int[] numbers:
int number: 1001
reference
5555
0
0
The arrays are
stored in a
heap.
Heap
reference
Array of ten int
values is stored here

rights reserved.
56
Heap
main method
int[] y:
int x: 1
reference
The arrays are
stored in a
heap.
Heap
5555
0
0
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.
57
Passing Arrays as Arguments
Objective: Demonstrate differences of
passing primitive data type variables
and array variables.
TestPassArray Run

rights reserved.
58
Example, cont.
Invoke swap(int n1, int n2).
The primitive type values in
a[0] and a[1] are passed to the
swap method.
main method
int[] a
Stack
swap method
n2: 2
n1: 1
reference
a[1]: 2
a[0]: 1
The arrays are
stored in a
heap.
Invoke swapFirstTwoInArray(int[] array).
The reference value in a is passed to the
swapFirstTwoInArray method.
Heap
main method
int[] a
Stack
swapFirstTwoInArray
method
int[] array
reference
reference

rights reserved.
59
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];
}
return result;
}
int[] list1 = {1, 2, 3, 4, 5, 6};
int[] list2 = reverse(list1);
list
result

rights reserved.
60
Trace the reverse Method
}
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
animation

rights reserved.
61
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
animation

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 0 0
i (= 0) is less than 6
animation

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 0 1
i = 0 and j = 5
Assign list[0] to result[5]
animation

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 0 1
After this, i becomes 1 and j
becomes 4
animation

rights reserved.
65
}
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
animation

rights reserved.
66
}
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]
animation

rights reserved.
67
}
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
animation

rights reserved.
68
}
return result;
}
int[] list1 = {1, 2, 3, 4, 5, 6};
list
result
1 2 3 4 5 6
0 0 0 0 2 1
animation

rights reserved.
69
}
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]
animation

rights reserved.
70
}
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
animation

rights reserved.
71
}
return result;
}
int[] list1 = {1, 2, 3, 4, 5, 6};
list
result
1 2 3 4 5 6
0 0 0 3 2 1
animation

rights reserved.
72
}
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
animation

rights reserved.
73
}
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
animation

rights reserved.
74
}
return result;
}
int[] list1 = {1, 2, 3, 4, 5, 6};
list
result
1 2 3 4 5 6
0 0 4 3 2 1
animation

rights reserved.
75
}
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
animation

rights reserved.
76
}
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
animation

rights reserved.
77
}
return result;
}
int[] list1 = {1, 2, 3, 4, 5, 6};
list
result
1 2 3 4 5 6
0 5 4 3 2 1
animation

rights reserved.
78
}
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
animation

rights reserved.
79
}
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
animation

rights reserved.
80
}
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.
animation

rights reserved.
81
}
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
animation

rights reserved.
82
Problem: Counting Occurrence of Each
Letter
 Generate 100 lowercase
letters randomly and assign
to an array of characters.
 Count the occurrence of each
letter in the array.
CountLettersInArray Run
(a) Executing
createArray in Line 6
main method
char[] chars: ref
Heap
Array of 100
characters
createArray method
char[] chars: ref
(b) After exiting
createArray in Line 6
main method
char[] chars: ref
Heap
Array of 100
characters
Stack Stack

rights reserved.
83
Searching Arrays
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])
return i;
return -1;
}
}
list
key Compare key with list[i] for i = 0, 1, …
[0] [1] [2] …
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.

rights reserved.
84
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.

rights reserved.
85
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.
86
http://www.cs.armstrong.edu/liang/animation/LinearSearc
hAnimation.html
Linear Search Animation
animation

rights reserved.
87
From Idea to Solution
/** The method for finding a key in the list */
public static int linearSearch(int[] list, int key) {
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.
88
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.

rights reserved.
89
Binary Search, cont.
 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.
Consider the following three cases:

rights reserved.
90
Binary Search
1 2 3 4 6 7 8 9
1 2 3 4 6 7 8 9
1 2 3 4 6 7 8 9
8
8
8
Key List
animation

rights reserved.
91
http://www.cs.armstrong.edu/liang/animation/BinarySearc
hAnimation.html
Binary Search Animation
animation

rights reserved.
92
[0] [1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12]
2 4 7 10 11 45 50 59 60 66 69 70 79
key is 11
key < 50
list
mid
[0] [1] [2] [3] [4] [5]
key > 7
key == 11
high
low
mid high
low
list
[3] [4] [5]
mid high
low
list
2 4 7 10 11 45
10 11 45

rights reserved.
93
[0] [1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12]
2 4 7 10 11 45 50 59 60 66 69 70 79
key is 54
key > 50
list
mid
[0] [1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12]
key < 66
key < 59
high
low
mid high
low
list
[7] [8]
mid high
low
list
59 60 66 69 70 79
59 60
[6] [7] [8]
high
low
59 60

rights reserved.
94
The binarySearch method returns the index of the
element in the list that matches 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.

rights reserved.
95
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;
}

rights reserved.
96
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));
char[] chars = {'a', 'c', 'g', 'x', 'y', 'z'};
System.out.println("Index is " +
java.util.Arrays.binarySearch(chars, 't'));
For the binarySearch method to work, the array must be pre-sorted in increasing
order.
Return is 4
Return is –4 (insertion point is
3, so return is -3-1)

rights reserved.
97
Sorting Arrays
Sorting, like searching, is also a common task in
computer programming. Many different algorithms
have been developed for sorting. This section
introduces two simple, intuitive sorting algorithms:
selection sort and insertion sort.

rights reserved.
98
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
2 9 5 4 8 1 6
swap
Select 1 (the smallest) and swap it
with 2 (the first) in the list
1 9 5 4 8 2 6
swap
The number 1 is now in the
correct position and thus no
longer needs to be considered.
1 2 5 4 8 9 6
swap
1 2 4 5 8 9 6
with 9 (the first) in the remaining
list
list
1 2 4 5 8 9 6
list
1 2 4 5 6 9 8
swap
1 2 4 5 6 8 9
list
Since there is only one element
remaining in the list, sort is
completed
5 is the smallest and in the right
position. No swap is necessary
swap

rights reserved.
99
http://www.cs.armstrong.edu/liang/animation/SelectionSo
rtAnimation.html
Selection Sort Animation
animation

rights reserved.
100
{
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.
101
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.
102
Expand
{
}
for (int j = i; j < list.length; j++) {
}
}

rights reserved.
103
Expand
{
}
if (currentMinIndex != i) {
list[currentMinIndex] = list[i];
list[i] = currentMin;
}

rights reserved.
104
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)

rights reserved.
105
Insertion Sort
int[] 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.
2 9 5 4 8 1 6
Step 1: Initially, the sorted sublist contains the
first element in the list. Insert 9 into the sublist.
2 9 5 4 8 1 6
Step2: The sorted sublist is {2, 9}. Insert 5 into
the sublist.
2 5 9 4 8 1 6
Step 3: The sorted sublist is {2, 5, 9}. Insert 4
into the sublist.
2 4 5 9 8 1 6
Step 4: The sorted sublist is {2, 4, 5, 9}. Insert 8
into the sublist.
2 4 5 8 9 1 6
Step 5: The sorted sublist is {2, 4, 5, 8, 9}. Insert
1 into the sublist.
1 2 4 5 8 9 6
Step 6: The sorted sublist is {1, 2, 4, 5, 8, 9}.
Insert 6 into the sublist.
1 2 4 5 6 8 9
Step 7: The entire list is now sorted.

rights reserved.
106
http://www.cs.armstrong.edu/liang/animation/InsertionSor
tAnimation.html
Insertion Sort Animation
animation

rights reserved.
107
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 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

rights reserved.
108
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.
[0] [1] [2] [3] [4] [5] [6]
2 5 9 4
list Step 1: Save 4 to a temporary variable currentElement
[0] [1] [2] [3] [4] [5] [6]
2 5 9
list Step 2: Move list[2] to list[3]
[0] [1] [2] [3] [4] [5] [6]
2 5 9
list Step 3: Move list[1] to list[2]
[0] [1] [2] [3] [4] [5] [6]
2 4 5 9
list Step 4: Assign currentElement to list[1]

rights reserved.
109
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] ...

rights reserved.
110
insert list[i] into a sorted sublist list[0..i-1] so that
list[0..i] is sorted
}
InsertSort
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;

rights reserved.
111
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);

06slide

More Related Content

What's hot (19)

Similar to 06slide (20)

More from Dorothea Chaffin (7)

Recently uploaded (20)

06slide