Sa07slide (SingleDimensionalArray)

Single-Dimensional
Arrays
1
Introducing Arrays
Array is a data structure that represents a collection of the
same types of data.
double myList [10];
myList[0] 5.6
myList[1] 4.5
myList[2] 3.3
myList[3] 13.2
myList[4] 4.0
Array element at
myList[5] 34.33 Element value
index 5
myList[6] 34.0
myList[7] 45.45
myList[8] 99.993
myList[9] 111.23
2
Declaring Array Variables
datatype arrayName[arraySize];
Example:
double myList[10];
C++ requires that the array size used to declare an array must be a
constant expression. For example, the following code is illegal:
int size = 4;
double myList[size]; // Wrong
But it would be OK, if size is a constant as follow:
const int size = 4;
double myList[size]; // Correct
3
Arbitrary Initial Values
When an array is created, its elements

are assigned with arbitrary values.
4
Indexed Variables
The array elements are accessed through the index. Array
indices are 0-based; that is, they start from 0 to arraySize-1.
In the past 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:
arrayName[index];
For example, myList[9] represents the last element in the

array myList.
5
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];
6
No Bound Checking
C++ does not check array’s boundary. So, accessing
array elements using subscripts beyond the
boundary (e.g., myList[-1] and myList[11]) does
not cause syntax errors, but the operating system
might report a memory access violation.
7
Array Initializers
Declaring, creating, initializing in one step:
dataType arrayName[arraySize] = {value0, value1,
..., valuek};
double myList[4] = {1.9, 2.9, 3.4, 3.5};
8
Declaring, creating, initializing
Using the Shorthand Notation
double myList[4] = {1.9, 2.9, 3.4, 3.5};
This shorthand notation is equivalent to the
following statements:
double myList[4];
myList[0] = 1.9;
myList[1] = 2.9;
myList[2] = 3.4;
myList[3] = 3.5;
9
Implicit Size
C++ allows you to omit the array size when
declaring and creating an array using an initilizer.
For example, the following declaration is fine:
double myList[] = {1.9, 2.9, 3.4, 3.5};
C++ automatically figures out how many elements

are in the array.
10
Partial Initialization
C++ allows you to initialize a part of the array. For
example, the following statement assigns values
1.9, 2.9 to the first two elements of the array. The
other two elements will be set to zero. Note that if
an array is declared, but not initialized, all its
elements will contain “garbage”, like all other local
variables.
double myList[4] = {1.9, 2.9};
11
Initializing Character Arrays
char city[] = {'D', 'a', 'l', 'l', 'a', 's'};
char city[] = "Dallas";

This statement is equivalent to the preceding statement,
except that C++ adds the character '\0', called the null
terminator, to indicate the end of the string, as shown in
Figure below.
'D' 'a' 'l' 'l' 'a' 's' '\0'

city[0] city[1] city[2] city[3] city[4] city[5] city[6]
12
Initializing arrays with random
values
The following loop initializes the array myList with random
values between 0 and 99:
for (int i = 0; i < ARRAY_SIZE; i++)

{
myList[i] = rand() % 100;
}
13
animation
Trace Program with Arrays
Declare array variable values, create an
array, and assign its reference to values
int main()
{ After the array is created
int values[5]={0}; 0 0
for (int i = 1; i < 5; i++) 1 0
{ 2 0
values[i] = i + values[i-1]; 3 0
} 4 0
values[0] = values[1] + values[4];

}
14
animation
i becomes 1
int main()
{ After the array is created
int values[5]={0};
for (int i = 1; i < 5; i++) 0 0
{ 1 0
0
values[i] = i + values[i-1]; 2
3 0
} 4 0
}
15
animation
i (=1) is less than 5
int main()
{
After the array is created
int values[5];
for (int i = 1; i < 5; i++) 0 0
{ 1 0
values[i] = values[i] + values[i-1]; 2 0
} 3 0
4 0
}
16
animation
After this line is executed, value[1] is 1
int main()
{ After the first iteration
for (int i = 1; i < 5; i++) 1 1
{ 2 0
} 4 0

}
17
animation

After i++, i becomes 2
int main()
{
int values[5]={0}; After the first iteration
for (int i = 1; i < 5; i++) 0 0
{ 1
2
1
} 4 0
values[0] = values[1] +
values[4];
}
18
animation
i (= 2) is less than 5
int main()
{
int values[5]={0};
for (int i = 1; i < 5; i++) After the first iteration
{ 0 0
0
} 2
3 0
values[0] = values[1] + 4 0
values[4];
}
19
animation
After this line is executed,
values[2] is 3 (2 + 1)
int main()
{ After the second iteration
int values[5]={0};
0
for (int i = 1; i < 5; i++) 0
1 1
{
2 3
values[i] = i + values[i-1];
3 0
} 0
4
}
}
20
animation
After this, i becomes 3.
int main()
for (int i = 1; i < 5; i++) 1 1
{ 2 3
} 4 0

}
21
animation
i (=3) is still less than 5.
int main()
for (int i = 1; i < 5; i++) 1 1
{ 2 3
} 4 0

}
22
animation
After this line, values[3] becomes 6 (3 + 3)
int main()
{ After the third iteration
for (int i = 1; i < 5; i++) 1 1
{ 2 3
} 4 0

}
23
animation
After this, i becomes 4
int main()
for (int i = 1; i < 5; i++) 1 1
{ 2 3
} 4 0

}
24
animation
i (=4) is still less than 5
int main()
for (int i = 1; i < 5; i++) 1 1
{ 2 3
} 4 0

}
25
animation
After this, values[4] becomes 10 (4 + 6)
int main()
{ After the fourth iteration
for (int i = 1; i < 5; i++) 1 1
{ 2 3
} 4 10

}
26
animation
After i++, i becomes 5
int main()
{
int values[5]={0};
for (int i = 1; i < 5; i++)
{ After the fourth iteration
values[i] = i + values[i-1];
} 0 0
values[0] = values[1] + values[4]; 1 1
} 2 3
3 6
4 10
27
animation

i ( =5) < 5 is false. Exit the loop
int main()
{
int values[5]={0};
for (int i = 1; i < 5; i++) After the fourth iteration
{
values[i] = i + values[i-1]; 0
1
0
1
} 2 3
} 4 10
28
animation
After this line, values[0] is 11 (1 + 10)
int main()
{
int values[5]={0};
for (int i = 1; i < 5; i++) 0 11
{ 1 1
} 3 6
29
Printing arrays
To print an array, you have to print each element in the array
using a loop like the following:

{
cout << myList[i] << " ";
}
30
Printing Character Array
For a character array, it can be printed using one print
statement. For example, the following code displays
Dallas:
char city[] = "Dallas";

cout << city;
31
Copying Arrays
Can you copy array using a syntax like this?
list = myList;
This is not allowed in C++. You have to copy individual

elements from one array to the other as follows:

{
list[i] = myList[i];
}
32
Summing All Elements
Use a variable named total to store the sum. Initially total
is 0. Add each element in the array to total using a loop
like this:
double total = 0;
{
total += myList[i];
}
33
Finding the Largest Element
Use a variable named max to store the largest element.
Initially max is myList[0]. To find the largest element in
the array myList, compare each element in myList with
max, update max if the element is greater than max.
double max = myList[0];

{
if (myList[i] > max) max = myList[i];
}
34
Finding the smallest index of the
largest element
double max = myList[0];
int indexOfMax = 0;
{
if (myList[i] > max)
{
max = myList[i];
indexOfMax = i;
}
}
35
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.
int linearSearch(const int list[], int key, int arraySize)
{
for (int i = 0; i < arraySize; i++)
{
if (key == list[i])
return i; [0] [1] [2] …
} list
return -1; key Compare key with list[i] for i = 0, 1, …
}
36
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.
37
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
38
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.
39
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.
40
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
41
key is 11 low mid high
key < 50 [0] [1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12]
list 2 4 7 10 11 45 50 59 60 66 69 70 79
low mid high
[0] [1] [2] [3] [4] [5]

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

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

59 60
43
The binarySearch method returns the index of the
search key if it is contained in the list. Otherwise,
it returns –insertion point - 1. The insertion point is
the point at which the key would be inserted into
the list.
44
From Idea to Solution
int binarySearch(const int list[], int key, int arraySize)
{
int low = 0;
int high = arraySize - 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 –low - 1;
}
45
Sorting Arrays
Sorting, like searching, is also a common task in
computer programming. It would be used, for
instance, if you wanted to display the grades from
Listing 6.2, AssignGrade.cpp, in alphabetical order.
Many different algorithms have been developed for
sorting. This section introduces two simple, intuitive
sorting algorithms: selection sort and insertion sort.
46
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 2 9 5 4 8 1 6

with 2 (the first) in the list
swap
The number 1 is now in the
Select 2 (the smallest) and swap it 1 9 5 4 8 2 6 correct position and thus no
with 9 (the first) in the remaining longer needs to be considered.
list swap

list
5 is the smallest and in the right 1 2 4 5 8 9 6 correct position and thus no
position. No swap is necessary longer needs to be considered.
swap

list swap

list

Since there is only one element 1 2 4 5 6 8 9 correct position and thus no
remaining in the list, sort is longer needs to be considered.
completed
47

Sa07slide (SingleDimensionalArray)

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Sa07slide (SingleDimensionalArray)

Uploaded by

Copyright:

Available Formats

Single-Dimensional

When an array is created, its elements

Each element in the array is represented using the

For example, myList[9] represents the last element in the

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

double myList[4] = {1.9, 2.9, 3.4, 3.5};

double myList[] = {1.9, 2.9, 3.4, 3.5};

C++ automatically figures out how many elements

double myList[4] = {1.9, 2.9};

char city[] = "Dallas";

'D' 'a' 'l' 'l' 'a' 's' '\0'

for (int i = 0; i < ARRAY_SIZE; i++)

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

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

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

Trace Program with Arrays

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

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

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

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

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

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

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

Trace Program with Arrays

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

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

for (int i = 0; i < ARRAY_SIZE; i++)

char city[] = "Dallas";

This is not allowed in C++. You have to copy individual

for (int i = 0; i < ARRAY_SIZE; i++)

double max = myList[0];

Linear Search Animation

[0] [1] [2] [3] [4] [5]

low mid high

[3] [4] [5]

low mid high

[6] [7] [8]

while (high >= low)

Select 1 (the smallest) and swap it 2 9 5 4 8 1 6

The number 2 is now in the

The number 5 is now in the

The number 6 is now in the

The number 8 is now in the

You might also like