SSK 1102 2023/2024-1

Fundamental of
Programming
TOPIC 6 – SINGLE DIMENSIONAL ARRAYS

mfs
Source: pexels.com
 OPENING PROBLEM
Read one hundred numbers, compute their average,
and find out how many numbers are above the
average.
 OBJECTIVES 1 of 2
• To describe why arrays are necessary in programming.
• To declare array reference variables and create arrays).
• To obtain array size using arrayRefVar.length and know default values in an
array.
• To access array elements using indexes.
• To declare, create, and initialize an array using an array initializer.
• To program common array operations (displaying arrays, summing all elements,
finding the minimum and maximum elements, random shuffling, and shifting
elements).
• To simplify programming using the foreach loops.
 OBJECTIVES 2 of 2
• To apply arrays in application development (AnalyzeNumbers, DeckOfCards).
• To copy contents from one array to another.
• To develop and invoke methods with array arguments and return values.
• To define a method with a variable-length argument list.
• To search elements using the linear or binary search algorithm.
• To sort an array using the selection sort approach.
• To use the methods in the java.util.Arrays class.
• To pass arguments to the main method from the command line.
 INTRODUCING ARRAYS
Array is a data structure that represents a collection of the same types of
data.
 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];
myList[0] references the first element in the array.
myList[9] references the last element in the array.
 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];
 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, 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];
 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;
 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};
TRACE PROGRAM WITH ARRAYS (1 of 16)
TRACE PROGRAM WITH ARRAYS (2 of 16)
TRACE PROGRAM WITH ARRAYS (3 of 16)
TRACE PROGRAM WITH ARRAYS (4 of 16)
TRACE PROGRAM WITH ARRAYS (5 of 16)
TRACE PROGRAM WITH ARRAYS (6 of 16)
TRACE PROGRAM WITH ARRAYS (7 of 16)
TRACE PROGRAM WITH ARRAYS (8 of 16)
TRACE PROGRAM WITH ARRAYS (9 of 16)
TRACE PROGRAM WITH ARRAYS (10 of 16)
TRACE PROGRAM WITH ARRAYS (11 of 16)
TRACE PROGRAM WITH ARRAYS (12 of 16)
TRACE PROGRAM WITH ARRAYS (13 of 16)
TRACE PROGRAM WITH ARRAYS (14 of 16)
TRACE PROGRAM WITH ARRAYS (15 of 16)
TRACE PROGRAM WITH ARRAYS (16 of 16)
 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)
 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 - 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;
}
SHIFTING ELEMENTS
 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.
 ANALYZE NUMBERS
Read one hundred numbers, compute their average, and find out how many numbers
are above the average.

AnalyzeNumbers
 PROBLEM: DECK OF CARDS (1 of 4)
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
PROBLEM: DECK OF CARDS (2 of 4)
PROBLEM: DECK OF CARDS (3 of 4)

DeckOfCards
 PROBLEM: DECK OF CARDS (4 of 4)
This problem builds a foundation for future more interesting and realistic
applications:
See Exercise 20.15.

https://liveexample.pearsoncmg.com/dsanimation/24Point.html
 COPYING ARRAYS (1 of 2)
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;
 COPYING ARRAYS (2 of 2)
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
 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
 CALL STACK (1 of 2)
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.
 CALL STACK (2 of 2)
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.
 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.

Heap

The arrays are

5555 stored in a
0 heap.
Space required for the
main method
int[] y: reference
int x: 1 0
 PASSING ARRAYS AS ARGUMENTS
Objective: Demonstrate differences of passing primitive data type variables
and array variables.

TestPassArray
 EXAMPLE
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.
RETURNING AN ARRAY FROM A METHOD
TRACE THE REVERSE METHOD (1 OF 22)
TRACE THE REVERSE METHOD (2 OF 22)
TRACE THE REVERSE METHOD (3 OF 22)
TRACE THE REVERSE METHOD (4 OF 22)
TRACE THE REVERSE METHOD (5 OF 22)
TRACE THE REVERSE METHOD (6 OF 22)
TRACE THE REVERSE METHOD (7 OF 22)
TRACE THE REVERSE METHOD (8 OF 22)
TRACE THE REVERSE METHOD (9 OF 22)
TRACE THE REVERSE METHOD (10 OF 22)
TRACE THE REVERSE METHOD (11 OF 22)
TRACE THE REVERSE METHOD (12 OF 22)
TRACE THE REVERSE METHOD (13 OF 22)
TRACE THE REVERSE METHOD (14 OF 22)
TRACE THE REVERSE METHOD (15 OF 22)
TRACE THE REVERSE METHOD (16 OF 22)
TRACE THE REVERSE METHOD (17 OF 22)
TRACE THE REVERSE METHOD (18 OF 22)
TRACE THE REVERSE METHOD (19 OF 22)
TRACE THE REVERSE METHOD (20 OF 22)
TRACE THE REVERSE METHOD (21 OF 22)
TRACE THE REVERSE METHOD (22 OF 22)
 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
 VARIABLE-LENGTH ARGUMENTS
You can pass a variable number of arguments of the same type to a method.

VarArgsDemo
 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, …
}
 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.
 LINEAR SEARCH ANIMATION

https://liveexample.pearsoncmg.com/dsanimation/LinearSearcheBook.html
FROM IDEA TO SOLUTION (1 of 6)

Trace the method

 BINARY SEARCH (1 of 6)
• 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 (2 of 6)
• 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 (3 of 6)
BINARY SEARCH (4 of 6)
 BINARY SEARCH (5 of 6)
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
 BINARY SEARCH (6 of 6)
• The binary Search 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.
 BINARY SEARCH ANIMATION
https://liveexample.pearsoncmg.com/dsanimation/BinarySearcheBook.html
 FROM IDEA TO SOLUTION (2 of 6)
/** 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;
}
 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.

For the binarySearch method to work, the array must be pre-sorted in

increasing order.
 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.
 SELECTION SORT ANIMATION
https://liveexample.pearsoncmg.com/dsanimation/SelectionSortNew.html
 FROM IDEA TO SOLUTION (3 of 6)
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]
FROM IDEA TO SOLUTION (4 of 6)
FROM IDEA TO SOLUTION (5 of 6)
FROM IDEA TO SOLUTION (6 of 6)
WRAP IT IN A METHOD
 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.
 THE Arrays.toString(list) METHOD
The Arrays.toString(list) method can be used to return a string representation
for the list.
 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); }
} }
}
 COMMAND-LINE PARAMETERS
class TestMain {
public static void main(String[] args) {
...
}
}
java TestMain arg0 arg1 arg2 ... argn
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.
 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
java Calculator 2 / 3
java Calculator 2.3

Calculator
 COPYRIGHT

This work is protected by United States copyright laws and is

provided solely for the use of instructors in teaching their courses
and assessing student learning. Dissemination or sale of any part
of this work (including on the World Wide Web) will destroy the
integrity of the work and is not permitted. The work and materials
from it should never be made available to students except by
instructors using the accompanying text in their classes. All
recipients of this work are expected to abide by these restrictions
and to honor the intended pedagogical purposes and the needs of
other instructors who rely on these materials.
 REFERENCES
• Introduction to JAVA Programming and Data Structures Comprehensive Version
by Y. Daniel Liang 12th edition. ISBN: 978-0-13-652023-8