0% found this document useful (0 votes)

23 views104 pages

06 Slide

The document discusses arrays in Java programming. It defines an array as a data structure that holds a collection of the same type of data elements. The document covers how to declare, create, initialize arrays and access array elements using indexed variables. It also discusses default element values, array length, array initializers, and examples of using arrays in programs.

Uploaded by

Melinte Alexandra

We take content rights seriously. If you suspect this is your content, claim it here.

Available Formats

Download as PPT, PDF, TXT or read online on Scribd

0% found this document useful (0 votes)

23 views104 pages

06 Slide

Uploaded by

Melinte Alexandra

We take content rights seriously. If you suspect this is your content, claim it here.

Available Formats

Download as PPT, PDF, TXT or read online on Scribd

You are on page 1/ 104

Chapter 6 Arrays

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

Solution

AnalyzeNumbers

Run

Run with prepared input

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 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 min and max elements, random shuffling, shifting elements) (6.2.6). To simplify programming using the for-each loops (6.2.7). To apply arrays in the LottoNumbers and DeckOfCards problems (6.3-6.4). To copy contents from one array to another (6.5). To develop and invoke methods with array arguments and return value (6.66.7). To define a method with variable-length argument list (6.8). To search elements using the linear (6.9.1) or binary (6.9.2) search algorithm. To sort an array using the selection sort (6.10.1) To sort an array using the insertion sort algorithm (6.10.2). To use the methods in the Arrays class (6.11).
Liang, Introduction to Java Programming, Eighth Edition, (c) 2011 Pearson Education, Inc. All rights reserved. 0132130807

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] myList[1] Array reference variable myList[2] myList[3] myList[4] Array element at index 5 myList[5] myList[6] myList[7] myList[8] myList[9] 5.6 4.5 3.3 13.2 4 34.33 34 45.45 99.993 11123
5

Element value

Declaring Array Variables

datatype[] arrayRefVar;

Example:
double[] myList;

datatype arrayRefVar[]; // This style is allowed, but not preferred Example:

double myList[];

Creating Arrays
arrayRefVar = new datatype[arraySize]; Example:
myList = new double[10];

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

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];
Liang, Introduction to Java Programming, Eighth Edition, (c) 2011 Pearson Education, Inc. All rights reserved. 0132130807

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

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.

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];
Liang, Introduction to Java Programming, Eighth Edition, (c) 2011 Pearson Education, Inc. All rights reserved. 0132130807

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

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.

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;
Liang, Introduction to Java Programming, Eighth Edition, (c) 2011 Pearson Education, Inc. All rights reserved. 0132130807

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};
Liang, Introduction to Java Programming, Eighth Edition, (c) 2011 Pearson Education, Inc. All rights reserved. 0132130807

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) { int[] values = new int[5]; for (int i = 1; i < 5; i++) { values[i] = i + values[i-1]; } values[0] = values[1] + values[4]; } }

After the array is created

0 1 2 3 4

0 0 0 0 0

animation

Trace Program with Arrays

i becomes 1

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

After the array is created

0 1 2 3 4

0 0 0 0 0

animation

Trace Program with Arrays

i (=1) is less than 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]; } values[0] = values[1] + values[4]; } }

After the array is created

0 1 2 3 4

0 0 0 0 0

animation

Trace Program with Arrays

After this line is executed, value[1] is 1

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

After the first iteration

0 1 2 3 4

0 1 0 0 0

animation

Trace Program with Arrays

After i++, i becomes 2

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

After the first iteration

0 1 2 3 4

0 1 0 0 0

animation

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]; } }
i (= 2) is less than 5

After the first iteration

0 1 2 3 4

0 1 0 0 0

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) { int[] values = new int[5]; for (int i = 1; i < 5; i++) { values[i] = i + values[i-1]; } values[0] = values[1] + values[4]; } }

After the second iteration

0 1 2 3 4

0 1 3 0 0

animation

Trace Program with Arrays

After this, i becomes 3.

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

After the second iteration

0 1 2 3 4

0 1 3 0 0

animation

Trace Program with Arrays

i (=3) is still less than 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]; } values[0] = values[1] + values[4]; } }

After the second iteration

0 1 2 3 4

0 1 3 0 0

animation

Trace Program with Arrays

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

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

After the third iteration

0 1 2 3 4

0 1 3 6 0

animation

Trace Program with Arrays

After this, i becomes 4

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

After the third iteration

0 1 2 3 4

0 1 3 6 0

animation

Trace Program with Arrays

i (=4) is still less than 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]; } values[0] = values[1] + values[4]; } }

After the third iteration

0 1 2 3 4

0 1 3 6 0

animation

Trace Program with Arrays

After this, values[4] becomes 10 (4 + 6)

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

After the fourth iteration

0 1 2 3 4

0 1 3 6 10

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

After the fourth iteration

0 1 2 3 4

0 1 3 6 10

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

After the fourth iteration

0 1 2 3 4

0 1 3 6 10

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

0 1 2 3 4

11 1 3 6 10

Processing Arrays
See the examples in the text.
1.

(Initializing arrays with input values)

2.
3. 4. 5. 6. 7. 8.

(Initializing arrays with random values)

(Printing arrays) (Summing all elements) (Finding the largest element) (Finding the smallest index of the largest element) (Random shuffling) (Shifting elements)
Liang, Introduction to Java Programming, Eighth Edition, (c) 2011 Pearson Education, Inc. All rights reserved. 0132130807

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

Initializing arrays with random values

for (int i = 0; i < myList.length; i++) { myList[i] = Math.random() * 100; }

Printing arrays
for (int i = 0; i < myList.length; i++) { System.out.print(myList[i] + " "); }

Summing all elements

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

Finding the largest element

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

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

Shifting Elements
double temp = myList[0]; // Retain the first element // Shift elements left for (int i = 1; i < myList.length; i++) { myList[i - 1] = myList[i]; } myList

// Move the first element to fill in the last position myList[myList.length - 1] = temp;

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.
Liang, Introduction to Java Programming, Eighth Edition, (c) 2011 Pearson Education, Inc. All rights reserved. 0132130807

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

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 52, as follows:
int[] deck = new int[52]; // Initialize cards for (int i = 0; i < deck.length; i++) deck[i] = i;

DeckOfCards
Liang, Introduction to Java Programming, Eighth Edition, (c) 2011 Pearson Education, Inc. All rights reserved. 0132130807

Run
42

Problem: Deck of Cards, cont.

0 . . . 12 13 . . . 25 26 . . . 38 39 . . . 51 13 Spades (? ) deck [0] 0 . . . . . . [12] 12 [13] 13 . . . . . . [25] 25 [26] 26 . . . . . . [38] 38 [39] 39 . . . . . . [51] 51 deck [0] 6 [1] 48 [2] 11 [3] 24 [4] . [5] . . . . . . . [25] . [26] . . . . . . . [38] . [39] . . . . . . . [51] . Card number 6 is 7 of Spades Card number 48 is 10 of Clubs Card number 11 is Queen of Spades

13 Hearts (? )

Random shuffle

13 Diamonds (? )

Card number 24 is Queen of Hearts

13 Clubs (? )

GUI Demo (picking four cards)

DeckOfCards

Run
43

Problem: Deck of Cards

This problem builds a foundation for future more interesting and realistic applications: See Exercise 25.9.

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 list2 = list1; list1 After the assignment list2 = list1; list1

Contents of list1

list2

Contents of list2

Garbage

Contents of list2

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

The arraycopy Utility

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

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
Liang, Introduction to Java Programming, Eighth Edition, (c) 2011 Pearson Education, Inc. All rights reserved. 0132130807

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.

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.

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] } }
Liang, Introduction to Java Programming, Eighth Edition, (c) 2011 Pearson Education, Inc. All rights reserved. 0132130807

Call Stack
Stack Space required for method m int[] numbers:reference int number: 1 Space required for the main method int[] y: reference int x: 1 Heap

0 0

The arrays are stored in a heap. Array of ten int values is

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.
Liang, Introduction to Java Programming, Eighth Edition, (c) 2011 Pearson Education, Inc. All rights reserved. 0132130807

Call Stack
Stack Space required for method m int[] numbers:reference int number: 1001 Space required for the main method int[] y: reference int x: 1 Heap The arrays are stored in a heap. Array of ten int values is stored here

5555 0

Heap
Heap

Space required for the main method int[] y: reference int x: 1

5555 0

The arrays are stored in a heap.

The JVM stores the array in an area of memory, called heap, which is used for dynamic memory allocation where blocks of memory are allocated and freed in an arbitrary order.
Liang, Introduction to Java Programming, Eighth Edition, (c) 2011 Pearson Education, Inc. All rights reserved. 0132130807

Passing Arrays as Arguments

Objective:

Demonstrate differences of passing primitive data type variables and array variables.
TestPassArray Run

Example, cont.
Stack Space required for the swap method n2: 2 n1: 1 Space required for the main method int[] a reference Heap Stack Space required for the swapFirstTwoInArray method int[] array reference Space required for the main method int[] a reference

a[1]: 2 a[0]: 1

Invoke swap(int n1, int n2). The primitive type values in a[0] and a[1] are passed to the swap method.

The arrays are stored in a heap.

Invoke swapFirstTwoInArray(int[] array). The reference value in a is passed to the swapFirstTwoInArray method.

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

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 result

0
58

animation

Trace the reverse Method, cont.

int[] list1 = new int[]{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 result

0
59

animation

Trace the reverse Method, cont.

int[] list1 = new int[]{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 result

0
60

animation

Trace the reverse Method, cont.

int[] list1 = new int[]{1, 2, 3, 4, 5, 6}; int[] list2 = reverse(list1);
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; }

i = 0 and j = 5 Assign list[0] to result[5]

list result

1
61

animation

Trace the reverse Method, cont.

After this, i becomes 1 and j becomes 4

list result

1
62

animation

Trace the reverse Method, cont.

i (=1) is less than 6

list result

1
63

animation

Trace the reverse Method, cont.

i = 1 and j = 4 Assign list[1] to result[4]

list result

1
64

animation

Trace the reverse Method, cont.

After this, i becomes 2 and j becomes 3

list result

1
65

animation

Trace the reverse Method, cont.

int[] list1 = new int[]{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 result

1
66

animation

Trace the reverse Method, cont.

i = 2 and j = 3 Assign list[i] to result[j]

list result

1
67

animation

Trace the reverse Method, cont.

After this, i becomes 3 and j becomes 2

list result

1
68

animation

Trace the reverse Method, cont.

int[] list1 = new int[]{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 result

1
69

animation

Trace the reverse Method, cont.

i = 3 and j = 2 Assign list[i] to result[j]

list result

1
70

animation

Trace the reverse Method, cont.

After this, i becomes 4 and j becomes 1

list result

1
71

animation

Trace the reverse Method, cont.

int[] list1 = new int[]{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 result

1
72

animation

Trace the reverse Method, cont.

i = 4 and j = 1 Assign list[i] to result[j]

list result

1
73

animation

Trace the reverse Method, cont.

After this, i becomes 5 and j becomes 0

list result

1
74

animation

Trace the reverse Method, cont.

int[] list1 = new int[]{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 result

1
75

animation

Trace the reverse Method, cont.

i = 5 and j = 0 Assign list[i] to result[j]

list result

1
76

animation

Trace the reverse Method, cont.

After this, i becomes 6 and j becomes -1

list result

1
77

animation

Trace the reverse Method, cont.

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

list result

1
78

animation

Trace the reverse Method, cont.

int[] list1 = new int[]{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

list2
result
6 5 4 3 2 1
79

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.

(a) Executing createArray in Line 6 Stack Heap

(b) After exiting createArray in Line 6 Stack Heap

Space required for the createArray method char[] chars: ref Space required for the main method char[] chars: ref

Array of 100 characters Space required for the main method char[] chars: ref

Array of 100 characters

CountLettersInArray

Run
80

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++) [0] [1] [2] if (key == list[i]) return i; list return -1; key Compare key with list[i] for i = 0, 1, } }
Liang, Introduction to Java Programming, Eighth Edition, (c) 2011 Pearson Education, Inc. All rights reserved. 0132130807

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.
Liang, Introduction to Java Programming, Eighth Edition, (c) 2011 Pearson Education, Inc. All rights reserved. 0132130807

animation

Linear Search Animation

Key
3 3 3

List

6
6 6 6

4
4 4 4

1
1 1 1

9
9 9 9

7
7 7 7

3
3 3 3

2
2 2 2

8
8 8 8

6
6

4
4

1
1

9
9

7
7

3
3

2
2

8
8
83

From Idea to Solution

/** The method for finding a key in the list */ public static int linearSearch(int[] list, int key) { for (int i = 0; i < list.length; i++) if (key == list[i]) return i; return -1; }

Trace the method

int[] int i int j int k list = {1, 4, 4, 2, 5, -3, 6, 2}; = linearSearch(list, 4); // returns 1 = linearSearch(list, -4); // returns -1 = linearSearch(list, -3); // returns 5
Liang, Introduction to Java Programming, Eighth Edition, (c) 2011 Pearson Education, Inc. All rights reserved. 0132130807

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.

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.
Liang, Introduction to Java Programming, Eighth Edition, (c) 2011 Pearson Education, Inc. All rights reserved. 0132130807

animation

Binary Search
Key
8 8 8

List

1
1

2
2

3
3

4
4

6
6

7
7

8
8

9
9

Binary Search, cont.

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

key > 7

[0] [1] [2] [3] [4] [5] list 2 4 7 10 11 45 low mid high

[3] [4] [5] key == 11 list 10 11 45

key is 54 key > 50

low midcont. Binary Search, list 2 4 7 10 11 45

high

[0] [1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] 50 59 60 66 69 70 79 low mid high

key < 66

[0] [1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] list 59 60 66 69 70 79 low mid high

[7] [8] key < 59 list low 59 60 high

[6] [7] [8] 59 60

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.

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; }
Liang, Introduction to Java Programming, Eighth Edition, (c) 2011 Pearson Education, Inc. All rights reserved. 0132130807

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.

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.

Selection Sort
Selection sort finds the largest number in the list and places it last. It then finds the largest number remaining and places it next to last, and so on until the list contains only a single number. Figure 6.17 shows how to sort the list {2, 9, 5, 4, 8, 1, 6} using selection sort.
swap Select 1 (the smallest) and swap it with 2 (the first) in the list 2 9 5 4 swap Select 2 (the smallest) and swap it with 9 (the first) in the remaining list Select 4 (the smallest) and swap it with 5 (the first) in the remaining list 5 is the smallest and in the right position. No swap is necessary Select 6 (the smallest) and swap it with 8 (the first) in the remaining list Select 8 (the smallest) and swap it with 9 (the first) in the remaining list Since there is only one element remaining in the list, sort is completed 1 9 5 4 8 2 6 The number 1 is now in the correct position and thus no longer needs to be considered. The number 2 is now in the correct position and thus no longer needs to be considered. The number 6 is now in the correct position and thus no longer needs to be considered. The number 5 is now in the correct position and thus no longer needs to be considered. The number 6 is now in the correct position and thus no longer needs to be considered. The number 8 is now in the correct position and thus no longer needs to be considered. 8 1 6

swap 1 2 5 4 8 9 6

9 swap

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..listSize-1] }

list[0] list[1] list[2] list[3] ... list[0] list[1] list[2] list[3] ... list[0] list[1] list[2] list[3] ... list[0] list[1] list[2] list[3] ... list[0] list[1] list[2] list[3] ... ... list[0] list[1] list[2] list[3] ...
Liang, Introduction to Java Programming, Eighth Edition, (c) 2011 Pearson Education, Inc. All rights reserved. 0132130807

list[10] list[10] list[10] list[10] list[10]

list[10]
95

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

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

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; } } // Swap list[i] with list[currentMinIndex] if necessary; if (currentMinIndex != i) { list[currentMinIndex] = list[i]; list[i] = currentMin; Invoke it } } selectionSort(yourList) }

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.
Step 1: Initially, the sorted sublist contains the first element in the list. Insert 9 to the sublist. Step2: The sorted sublist is {2, 9}. Insert 5 to the sublist. Step 3: The sorted sublist is {2, 5, 9}. Insert 4 to the sublist. Step 4: The sorted sublist is {2, 4, 5, 9}. Insert 8 to the sublist. Step 5: The sorted sublist is {2, 4, 5, 8, 9}. Insert 1 to the sublist. Step 6: The sorted sublist is {1, 2, 4, 5, 8, 9}. Insert 6 to the sublist. Step 7: The entire list is now sorted 2 9 5 4 8 1 6

100

animation

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

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

2
2 1

5
4 2

9
5 4

4
8 5

8
9 6

1
1 8

6
2 6

1
9

101

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] list 2 5 9 4 Step 1: Save 4 to a temporary variable currentElement

[0] [1] [2] [3] [4] [5] [6] list 2 5 9 Step 2: Move list[2] to list[3]

[0] [1] [2] [3] [4] [5] [6] list 2 5 9 Step 3: Move list[1] to list[2]

[0] [1] [2] [3] [4] [5] [6] list 2 4 5 9 Step 4: Assign currentElement to list[1]

102

From Idea to Solution

for (int i = 1; 1; i < list,length; i++) { insert list[i] into a sorted sublist list[0..i-1] so that list[0..i] is sorted } list[0] list[0] list[1]

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

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

103

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

104

642 436 Cvoice
75% (4)
642 436 Cvoice
25 pages
Chapter 7: Single-Dimensional Arrays: CS1: Java Programming Colorado State University
No ratings yet
Chapter 7: Single-Dimensional Arrays: CS1: Java Programming Colorado State University
112 pages
Chapter 7 Single-Dimensional Arrays
No ratings yet
Chapter 7 Single-Dimensional Arrays
105 pages
07slide - Short Version
No ratings yet
07slide - Short Version
74 pages
CH07
No ratings yet
CH07
111 pages
CH 7
No ratings yet
CH 7
82 pages
07 Slide
No ratings yet
07 Slide
55 pages
06 Java
No ratings yet
06 Java
93 pages
CH07 Redused
No ratings yet
CH07 Redused
76 pages
07 Slide
No ratings yet
07 Slide
109 pages
Chapter3 Lecture4 Array
No ratings yet
Chapter3 Lecture4 Array
50 pages
Chapter 4
No ratings yet
Chapter 4
45 pages
07 Arrays SingleDime
No ratings yet
07 Arrays SingleDime
113 pages
7 Array
No ratings yet
7 Array
87 pages
CSE215 A5 Arrays
No ratings yet
CSE215 A5 Arrays
38 pages
Original Slides by Daniel Liang Modified Slides by Salam Abdulla
No ratings yet
Original Slides by Daniel Liang Modified Slides by Salam Abdulla
112 pages
Chapter 7 Arrays
No ratings yet
Chapter 7 Arrays
33 pages
Oop2017 6
No ratings yet
Oop2017 6
75 pages
Introducing Arrays: Array Is A Data Structure That Represents A Collection of The Same Data Type of Data
No ratings yet
Introducing Arrays: Array Is A Data Structure That Represents A Collection of The Same Data Type of Data
82 pages
07slide (SingleDimensionalArray)
No ratings yet
07slide (SingleDimensionalArray)
99 pages
Lectures
No ratings yet
Lectures
46 pages
Arrays and The Arraylist Class: Starting Out With Java: From Control Structures Through Data Structures Second Edition
No ratings yet
Arrays and The Arraylist Class: Starting Out With Java: From Control Structures Through Data Structures Second Edition
72 pages
c02 JSE Intro Syntax Arrays OOP Jlib DevOps Docker
No ratings yet
c02 JSE Intro Syntax Arrays OOP Jlib DevOps Docker
111 pages
Lec 12
No ratings yet
Lec 12
83 pages
Lecture 4 - Java Programming - Arrays
No ratings yet
Lecture 4 - Java Programming - Arrays
10 pages
Arrays and The Arraylist Class: Starting Out With Java: From Control Structures Through Objects Fifth Edition
No ratings yet
Arrays and The Arraylist Class: Starting Out With Java: From Control Structures Through Objects Fifth Edition
75 pages
4 - 1D, 2D Arrays
No ratings yet
4 - 1D, 2D Arrays
62 pages
Week 6 A) Arrays B) Classes and Objects
No ratings yet
Week 6 A) Arrays B) Classes and Objects
32 pages
JEDI Slides-Intro1-Chapter07-Java Arrays
100% (1)
JEDI Slides-Intro1-Chapter07-Java Arrays
23 pages
Arrays (Java Tutorial)
No ratings yet
Arrays (Java Tutorial)
29 pages
CSC245 Lecture 5
No ratings yet
CSC245 Lecture 5
38 pages
Working With Arrays-1
No ratings yet
Working With Arrays-1
71 pages
Arrays and The Arraylist Class: Starting Out With Java: From Control Structures Through Objects Fifth Edition
No ratings yet
Arrays and The Arraylist Class: Starting Out With Java: From Control Structures Through Objects Fifth Edition
77 pages
Java Arrays
100% (1)
Java Arrays
23 pages
Lecture 8.2 - Multi-Dimensional Arrays
No ratings yet
Lecture 8.2 - Multi-Dimensional Arrays
125 pages
Array
No ratings yet
Array
30 pages
Arrays in Java
No ratings yet
Arrays in Java
14 pages
Arrays - Part 1
No ratings yet
Arrays - Part 1
23 pages
JEDI Slides-Intro1-Chapter07-Java Arrays
No ratings yet
JEDI Slides-Intro1-Chapter07-Java Arrays
23 pages
Arrays in Java
100% (1)
Arrays in Java
11 pages
Presentation 5
No ratings yet
Presentation 5
58 pages
14 Arrays
No ratings yet
14 Arrays
32 pages
CSE211 Lecture 5
No ratings yet
CSE211 Lecture 5
40 pages
Java Arrays-1
No ratings yet
Java Arrays-1
33 pages
Importance of Arrays
0% (1)
Importance of Arrays
92 pages
Tutorial 5
No ratings yet
Tutorial 5
29 pages
Arrays 2
No ratings yet
Arrays 2
68 pages
Chapter 7 Notes
No ratings yet
Chapter 7 Notes
87 pages
CSO Gaddis Java Chapter07 6e
No ratings yet
CSO Gaddis Java Chapter07 6e
75 pages
06 Arrays
No ratings yet
06 Arrays
44 pages
Sa07slide (SingleDimensionalArray)
No ratings yet
Sa07slide (SingleDimensionalArray)
47 pages
UNIT 1 Merged
No ratings yet
UNIT 1 Merged
146 pages
Chapter7 - Arrays (Programming I)
No ratings yet
Chapter7 - Arrays (Programming I)
79 pages
CSO Gaddis Java Chapter07 6ge
No ratings yet
CSO Gaddis Java Chapter07 6ge
75 pages
Advanced C Concepts and Programming: First Edition
From Everand
Advanced C Concepts and Programming: First Edition
Gayatri
3/5 (1)
Python for Absolute Beginners: Learn to Code Fast!
From Everand
Python for Absolute Beginners: Learn to Code Fast!
Ibnul Jaif Farabi
No ratings yet
Core Java Programming Book
From Everand
Core Java Programming Book
Manish Soni
No ratings yet
Profound Python Data Science
From Everand
Profound Python Data Science
Onder Teker
No ratings yet
Cracking Kotlin Interview: Solutions to Your Basic to Advanced Programming Questions
From Everand
Cracking Kotlin Interview: Solutions to Your Basic to Advanced Programming Questions
Swati Saxena
5/5 (1)
Introduction to Algorithms
From Everand
Introduction to Algorithms
S VASIST
No ratings yet
Learn Programming Using C#
From Everand
Learn Programming Using C#
Taurius Litvinavicius
No ratings yet
Windows Forms Programming in C
No ratings yet
Windows Forms Programming in C
564 pages
Switching
No ratings yet
Switching
48 pages
C H A P T e R 2
No ratings yet
C H A P T e R 2
8 pages
Ccmigration
No ratings yet
Ccmigration
698 pages
Cisco SIP
100% (1)
Cisco SIP
601 pages
Ixscriptmate Data Forwarding Test Suites: Ixanvl
No ratings yet
Ixscriptmate Data Forwarding Test Suites: Ixanvl
6 pages
Smeureanu POO in Limbajul C++
100% (1)
Smeureanu POO in Limbajul C++
167 pages
Chapter 5 - Spanning Tree Protocol: CCNA Exploration 4.0
No ratings yet
Chapter 5 - Spanning Tree Protocol: CCNA Exploration 4.0
58 pages
Ixnetwork Report: Test Date: Test: 08/21/2013 09:23:24 Rfc2544 - Throughput/Latency
No ratings yet
Ixnetwork Report: Test Date: Test: 08/21/2013 09:23:24 Rfc2544 - Throughput/Latency
17 pages
C
No ratings yet
C
31 pages