Lecture 1:

Single-Dimensional Arrays
Computer Programming Fundementals
College of Science and Technology- IT & CS

Original slides by Daniel Liang

Modified slides by Salam Abdulla
2020-2021: Semester 2
 Opening Problem

Read one hundred numbers, compute their

average, and find out how many numbers are
above the average.

2
 Objectives

 To describe why arrays are necessary in programming (§7.1).

 To declare array reference variables and create arrays (§§7.2.1–7.2.2).
 To obtain array size using arrayRefVar.length and know default values in an array (§7.2.3).
 To access array elements using indexes (§7.2.4).
 To declare, create, and initialize an array using an array initializer (§7.2.5).
 To program common array operations (displaying arrays, summing all elements, finding the
minimum and maximum elements, random shuffling, and shifting elements) (§7.2.6).
 To simplify programming using the foreach loops (§7.2.7).
 To apply arrays in application development (AnalyzeNumbers, DeckOfCards) (§§7.3–7.4).
 To copy contents from one array to another (§7.5).
 To develop and invoke methods with array arguments and return values (§§7.6–7.8).
 To define a method with a variable-length argument list (§7.9).
 To search elements using the linear (§7.10.1) or binary (§7.10.2) search algorithm.
 To sort an array using the selection sort approach (§7.11).
 To use the methods in the java.util.Arrays class (§7.12).
 To pass arguments to the main method from the command line (§7.13). 3
 Introducing Arrays

Array is a data structure that represents a collection of the

same types of data.

4
 Declaring Array Variables
• datatype[] arrayRefVar;
Example:
double[] myList;

• datatype arrayRefVar[]; // This style is

allowed, but not preferred
Example:
double myList[];

5
 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.

6
 Declaring and Creating
in One Step
• datatype[] arrayRefVar = new
datatype[arraySize];
double[] myList = new double[10];

• datatype arrayRefVar[] = new

datatype[arraySize];
double myList[] = new double[10];

7
 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

8
 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.

9
 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]; 10
 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];

11
 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.

12
 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:
double[] myList = new double[4];
myList[0] = 1.9;
myList[1] = 2.9;
myList[2] = 3.4;
myList[3] = 3.5;

13
 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}; 14

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] = i + values[i-1]; 2 0
} 3 0

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

}
}

15
animation
Trace Program with Arrays
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

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

} 2 0

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

16
animation
Trace Program with Arrays
i (=1) is less than 5

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
values[i] = i + values[i-1]; 1 0
} 2 0

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

} 4 0

17
animation
Trace Program with Arrays
After this line is executed, value[1] is 1

public class Test {

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

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

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

} 3 0

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

}
}

18
animation
Trace Program with Arrays
After i++, i becomes 2

public class Test {

public static void main(String[] args) {
int[] values = new int[5]; After the first iteration

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

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

} 2 0

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

4 0
}
}

19
animation
Trace Program with Arrays

i (= 2) is less than 5
public class Test {
public static void main(String[]
args) {
int[] values = new int[5]; After the first iteration

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

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

} 2 0

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

values[4]; 4 0

}
}

20
animation
Trace Program with Arrays
After this line is executed,
values[2] is 3 (2 + 1)

public class Test {

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

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

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

} 3 0

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

}
}

21
animation
Trace Program with Arrays
After this, i becomes 3.

public class Test {

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

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

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

} 3 0

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

}
}

22
animation
Trace Program with Arrays

i (=3) is still less than 5.

public class Test {

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

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

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

} 3 0

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

}
}

23
animation
Trace Program with Arrays

After this line, values[3] becomes 6 (3 + 3)

public class Test {

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

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

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

} 3 6

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

}
}

24
animation
Trace Program with Arrays
After this, i becomes 4

public class Test {

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

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

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

} 3 6

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

}
}

25
animation
Trace Program with Arrays
i (=4) is still less than 5

public class Test {

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

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

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

} 3 6

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

}
}

26
animation
Trace Program with Arrays
After this, values[4] becomes 10 (4 + 6)

public class Test {

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

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

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

} 3 6

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

}
}

27
animation
Trace Program with Arrays

After i++, i becomes 5

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];
After the fourth iteration
}
values[0] = values[1] + values[4]; 0 0
} 1
1
}
2 3

3 6

4 10

28
animation

Trace Program with Arrays

i ( =5) < 5 is false. Exit the loop

public class Test {

public static void main(String[] args) {
int[] values = new int[5];
for (int i = 1; i < 5; i++) { After the fourth iteration
values[i] = i + values[i-1];
} 0 0

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

} 4 10

29
animation
Trace Program with Arrays
After this line, values[0] is 11 (1 + 10)

public class Test {

public static void main(String[] args) {
int[] values = new int[5];
for (int i = 1; i < 5; i++) { 0 11

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

} 2 3

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

} 4 10
}

30
 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)
31
 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();

32
 Initializing arrays with random values

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

myList[i] = Math.random() * 100;
}

33
 Printing arrays

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

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

34
 Summing all elements

double total = 0;
for (int i = 0; i < myList.length; i++) {
total += myList[i];
}

35
 Finding the largest element

double max = myList[0];

for (int i = 1; i < myList.length; i++) {
if (myList[i] > max) max = myList[i];
}

36
 Random shuffling
for (int i = 0; i < myList.length - 1; i++) { myList
// Generate an index j randomly i [0] .
int j = (int)(Math.random() [1] .
* myList.length); .
[i] .
// Swap myList[i] with myList[j] .
double temp = myList[i]; . swap
myList[i] = myList[j]; A random index [j]
myList[j] = temp;
}

37
Shifting Elements

38
 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.
39
 Analyze Numbers

Read one hundred numbers, compute their

average, and find out how many numbers are
above the average.

AnalyzeNumbers Run

40
 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:

int[] deck = new int[52];

// Initialize cards
for (int i = 0; i < deck.length; i++)
deck[i] = i;
DeckOfCards Run

41
Problem: Deck of Cards, cont.

42
 Problem: Deck of Cards, cont.

GUI Demo (picking four cards) DeckOfCards Run

43
 Problem: Deck of Cards

This problem builds a foundation for future more interesting and

http://www.cs.armstrong.edu/liang/animation/web/2
realistic applications: 4Point.html

See Exercise 20.15.

Run 24 Point Game

44
Companion
Website
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.

Lotto Numbers Sample Data LottoNumbers Run

45
Companion
Website
Problem: Lotto Numbers

isCovered isCovered isCovered isCovered isCovered

false [0] true [0] true [0] true [0] true

[0]
[1] false [1] false [1] true [1] true [1] true

[2] false [2] false [2] false [2] true [2] true

[3] false [3] false [3] false [3] false [3] false

. . . . .

. . . . .

. . . . .

[97] [97] false [97] false [97] false [97] false

false
[98] [98] false [98] false [98] false [98] true
false

(a) (b) (c) (d) (e)

46
 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;
 

47
 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];

48
 The arraycopy Utility

arraycopy(sourceArray, src_pos,
targetArray, tar_pos, length);

Example:
System.arraycopy(sourceArray, 0,
targetArray, 0, sourceArray.length);

49
 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

50
 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.

51
 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
52
argument.
 Simple Example

public class Test {

public static void main(String[] args) {
int x = 1; // x represents an int value
int[] y = new int[10]; // y represents an array of int values
 
m(x, y); // Invoke m with arguments x and y
 
System.out.println("x is " + x);
System.out.println("y[0] is " + y[0]);
}
 
public static void m(int number, int[] numbers) {
number = 1001; // Assign a new value to number
numbers[0] = 5555; // Assign a new value to numbers[0]
}
} 53
 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.
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.
55
 Heap

Heap

The arrays are

5555 stored in a
0 heap.
Space required for the
main method
int[] y: reference
int x: 1 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.
56
 Passing Arrays as Arguments

• Objective: Demonstrate differences of

passing primitive data type variables
and array variables.

TestPassArray Run

57
 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.

58
 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 = {1, 2, 3, 4, 5, 6};

int[] list2 = reverse(list1);

59
animation
Trace the reverse Method
int[] list1 = {1, 2, 3, 4, 5, 6};
int[] list2 = reverse(list1);
Declare result and create array
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;
}

list 1 2 3 4 5 6

result 0 0 0 0 0 0

60
animation
Trace the reverse Method, cont.
int[] list1 = {1, 2, 3, 4, 5, 6};
int[] list2 = reverse(list1);
i = 0 and j = 5
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;
}

list 1 2 3 4 5 6

result 0 0 0 0 0 0

61
animation
Trace the reverse Method, cont.
int[] list1 = {1, 2, 3, 4, 5, 6};
int[] list2 = reverse(list1);
i (= 0) is less than 6
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;
}

list 1 2 3 4 5 6

result 0 0 0 0 0 0

62
animation
Trace the reverse Method, cont.
int[] list1 = {1, 2, 3, 4, 5, 6};
int[] list2 = reverse(list1);
i = 0 and j = 5
public static int[] reverse(int[] list) { Assign list[0] to result[5]
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;
}

list 1 2 3 4 5 6

result 0 0 0 0 0 1

63
animation
Trace the reverse Method, cont.
int[] list1 = {1, 2, 3, 4, 5, 6};
int[] list2 = reverse(list1);

After this, i becomes 1 and j

public static int[] reverse(int[] list) { becomes 4
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;
}

list 1 2 3 4 5 6

result 0 0 0 0 0 1

64
animation
Trace the reverse Method, cont.
int[] list1 = {1, 2, 3, 4, 5, 6};
int[] list2 = reverse(list1);

i (=1) is less than 6

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;
}

list 1 2 3 4 5 6

result 0 0 0 0 0 1

65
animation
Trace the reverse Method, cont.
int[] list1 = {1, 2, 3, 4, 5, 6};
int[] list2 = reverse(list1);
i = 1 and j = 4
public static int[] reverse(int[] list) { Assign list[1] to result[4]
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;
}

list 1 2 3 4 5 6

result 0 0 0 0 2 1

66
animation
Trace the reverse Method, cont.
int[] list1 = {1, 2, 3, 4, 5, 6};
int[] list2 = reverse(list1);
After this, i becomes 2 and
public static int[] reverse(int[] list) { j becomes 3
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;
}

list 1 2 3 4 5 6

result 0 0 0 0 2 1

67
animation
Trace the reverse Method, cont.
int[] list1 = {1, 2, 3, 4, 5, 6};
int[] list2 = reverse(list1);
i (=2) is still less than 6
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;
}

list 1 2 3 4 5 6

result 0 0 0 0 2 1

68
animation
Trace the reverse Method, cont.
int[] list1 = {1, 2, 3, 4, 5, 6};
int[] list2 = reverse(list1);
i = 2 and j = 3
public static int[] reverse(int[] list) { Assign list[i] to result[j]
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;
}

list 1 2 3 4 5 6

result 0 0 0 3 2 1

69
animation
Trace the reverse Method, cont.
int[] list1 = {1, 2, 3, 4, 5, 6};
int[] list2 = reverse(list1);
After this, i becomes 3 and
public static int[] reverse(int[] list) { j becomes 2
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;
}

list 1 2 3 4 5 6

result 0 0 0 3 2 1

70
animation
Trace the reverse Method, cont.
int[] list1 = {1, 2, 3, 4, 5, 6};
int[] list2 = reverse(list1);
i (=3) is still less than 6
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;
}

list 1 2 3 4 5 6

result 0 0 0 3 2 1

71
animation
Trace the reverse Method, cont.
int[] list1 = {1, 2, 3, 4, 5, 6};
int[] list2 = reverse(list1);
i = 3 and j = 2
public static int[] reverse(int[] list) { Assign list[i] to result[j]
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;
}

list 1 2 3 4 5 6

result 0 0 4 3 2 1

72
animation
Trace the reverse Method, cont.
int[] list1 = {1, 2, 3, 4, 5, 6};
int[] list2 = reverse(list1);
After this, i becomes 4 and
public static int[] reverse(int[] list) { j becomes 1
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;
}

list 1 2 3 4 5 6

result 0 0 4 3 2 1

73
animation
Trace the reverse Method, cont.
int[] list1 = {1, 2, 3, 4, 5, 6};
int[] list2 = reverse(list1);
i (=4) is still less than 6
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;
}

list 1 2 3 4 5 6

result 0 0 4 3 2 1

74
animation
Trace the reverse Method, cont.
int[] list1 = {1, 2, 3, 4, 5, 6};
int[] list2 = reverse(list1);
i = 4 and j = 1
public static int[] reverse(int[] list) { Assign list[i] to result[j]
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;
}

list 1 2 3 4 5 6

result 0 5 4 3 2 1

75
animation
Trace the reverse Method, cont.
int[] list1 = {1, 2, 3, 4, 5, 6};
int[] list2 = reverse(list1);
After this, i becomes 5 and
public static int[] reverse(int[] list) { j becomes 0
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;
}

list 1 2 3 4 5 6

result 0 5 4 3 2 1

76
animation
Trace the reverse Method, cont.
int[] list1 = {1, 2, 3, 4, 5, 6};
int[] list2 = reverse(list1);
i (=5) is still less than 6
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;
}

list 1 2 3 4 5 6

result 0 5 4 3 2 1

77
animation
Trace the reverse Method, cont.
int[] list1 = {1, 2, 3, 4, 5, 6};
int[] list2 = reverse(list1);
i = 5 and j = 0
public static int[] reverse(int[] list) { Assign list[i] to result[j]
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;
}

list 1 2 3 4 5 6

result 6 5 4 3 2 1

78
animation
Trace the reverse Method, cont.
int[] list1 = {1, 2, 3, 4, 5, 6};
int[] list2 = reverse(list1);
After this, i becomes 6 and
public static int[] reverse(int[] list) { j becomes -1
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;
}

list 1 2 3 4 5 6

result 6 5 4 3 2 1

79
animation
Trace the reverse Method, cont.
int[] list1 = {1, 2, 3, 4, 5, 6};
int[] list2 = reverse(list1);
i (=6) < 6 is false. So exit
public static int[] reverse(int[] list) { the loop.
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;
}

list 1 2 3 4 5 6

result 6 5 4 3 2 1

80
animation
Trace the reverse Method, cont.
int[] list1 = {1, 2, 3, 4, 5, 6};
int[] list2 = reverse(list1);
Return result
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;
}

list 1 2 3 4 5 6

list2
result 6 5 4 3 2 1

81
 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

82
 Variable-Length Arguments

You can pass a variable number of arguments of the same

type to a method.

VarArgsDemo Run

83
 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, …
}

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.
85
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
86
animation
Linear Search Animation

http://www.cs.armstrong.edu/liang/animation/web/Line
arSearch.html

87
 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
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.

89
 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.
90
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

91
animation
Binary Search Animation

http://www.cs.armstrong.edu/liang/animation/web/Bina
rySearch.html

92
Binary Search, cont.

93
 Binary Search, cont.
key is 54 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] [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
94
 Binary Search, cont.

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

98
 Selection Sort
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.

99
animation
Selection Sort Animation

http://www.cs.armstrong.edu/liang/animation/web/Sele
ctionSort.html

100
 From Idea to Solution

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

select the smallest element in list[i..listSize-1];
swap the smallest with list[i], if necessary;
// list[i] is in its correct position.
// The next iteration apply on list[i+1..listSize-1]
}
list[0] list[1] list[2] list[3] ... list[10]

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

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

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

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

...

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

for (int i = 0; i < listSize; i++) {
select the smallest element in list[i..listSize-1];
swap the smallest with list[i], if necessary;
// list[i] is in its correct position.
// The next iteration apply on list[i..listSize-1]
}

Expand
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;
}
}

102
for (int i = 0; i < listSize; i++) {
select the smallest element in list[i..listSize-1];
swap the smallest with list[i], if necessary;
// list[i] is in its correct position.
// The next iteration apply on list[i..listSize-1]
}

Expand
double currentMin = list[i];
int currentMinIndex = i;
for (int j = i; j < list.length; j++) {
if (currentMin > list[j]) {
currentMin = list[j];
currentMinIndex = j;
}
}

103
for (int i = 0; i < listSize; i++) {
select the smallest element in list[i..listSize-1];
swap the smallest with list[i], if necessary;
// list[i] is in its correct position.
// The next iteration apply on list[i..listSize-1]
}

Expand

if (currentMinIndex != i) {
list[currentMinIndex] = list[i];
list[i] = currentMin;
}

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]
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;
}
}

Invoke
// Swap list[i] with list[currentMinIndex] it
if necessary;
if (currentMinIndex != i) {
list[currentMinIndex] = list[i]; selectionSort(yourList)
list[i] = currentMin;
}
}
}
105
 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);
Java 8 now provides Arrays.parallelSort(list) that utilizes the multicore
for fast sorting.

106
 The Arrays.toString(list) Method

The Arrays.toString(list) method can be used to return a string

representation for the list.

107
Pass Arguments to Invoke the Main
Method

108
 Main Method Is Just a Regular Method

You can call a regular method by passing actual

parameters. Can you pass arguments to main? Of
course, yes. For example, the main method in class B
is invoked by a method in A, as shown below:

public class A { class B {

public static void main(String[] args) { public static void main(String[] args) {
String[] strings = {"New York", for (int i = 0; i < args.length; i++)
"Boston", "Atlanta"}; System.out.println(args[i]);
B.main(strings); }
} }
}

109
 Command-Line Parameters

class TestMain {
public static void main(String[] args) {
...
}
}

java TestMain arg0 arg1 arg2 ... argn

110
 Processing
Command-Line Parameters

In the main method, get the arguments from

args[0], args[1], ..., args[n], which
corresponds to arg0, arg1, ..., argn in
the command line.

111
 Problem: Calculator
• Objective: Write a program that will perform
binary operations on integers. The program
receives three parameters: an operator and two
integers.

java Calculator 2 + 3
java Calculator 2 - 3
Calculator java Calculator 2 / 3
Run java Calculator 2 . 3

112