Arrays(1D and 2D)

@LPU CSE202 C++ Programming

 Outline
• To declare an array
• To initialize an array
• Operations on array

@LPU CSE202 C++ Programming

 Introduction
• Arrays
– Collection of related data it ems of same data
type.
– Static entity – i.e. they rem ain the same size
throughout program tion
execu

@LPU CSE202 C++ Programming

 Arrays Name of array (Note
all elements of
that array have the
• Array name, c)
this
– Group of consecutive memory locationsc[0] -45
– Same name and data type same
c[1] 6
0
• To refer to an element, specify: c[2]
c[3] 72
– Array name c[4] 3
-89
– Position number in square brackets([]) c[5]
c[6] 0
• Format: c[7] 62
c[8] -3
arrayname[position_number] 1
c[9]
– First element is always at position 0 c[10] 6453
– Eg. n element array named c: c[11] 78
• c[0], c[1]...c[n –
1] Position number of
the element
@LPU CSE202 C++ Programming within array c
 Arrays
• An array is an ordered list of values
The entire array Each value has a
numeric index
has a single name
c[9]
c[0] c[1] c[2] c[3]
c c[4]
79 87 94 82 67 98 87c[5]81 74 91
c[6] c[7]
c[8]

An array of size N is indexed from zero to N-1

This array holds 10 values that are indexed from 0 to 9

@LPU CSE202 C++ Programming

 Arrays
• Array elements are like normal variables
c[0] = 3;/*stores 3 to c[0] element*/
• The position number inside square
brackets is called
subscript/index.
• Subscript must be integer or an integer
expression
c[5 - 2] = 7; (i.e. c[3] = 7)

@LPU CSE202 C++ Programming

 Defining Arrays
• When defining arrays, specify:
– Name
– Data Type of array
– Number of elements
datatype arrayName[numberOfElements];
– Examples:
int students[10];
float myArray[3284];
• Defining multiple arrays of
same data type
– Format is similar to regular
variables
– Example:
int b[100], x[27];
@LPU CSE202 C++ Programming
 Initializing Arrays
• Initializers
int n[5] = { 1, 2, 3,4, 5 };
– If not enough initializersgiven,
elements
then rightmost
become 0
– int n[5] = { 0 }; initialize
// all elements to 0
– C arrays have no bounds checking.
• If size is omitted, initializers
determine it
int n[] = { 1, 2, 3, 4, 5 };
– 5 initializers, therefore 5 element array.
@LPU CSE202 C++ Programming
2D-Array
A two – dimensional array can be seen as a table with ‘x’ rows and
‘y’ columns where the row number ranges from 0 to (x-1) and
column number ranges from 0 to (y-1). A two – dimensional array
‘x’ with 3 rows and 3 columns is shown below:

Examples:
Representing the marks of 60 students of class in 5 subjects, we
can take a 2D array of row size:60 and column size:5
Representing the sales done by all(50) sales persons of a
particular branch for all months(12), we can take a 2D array of row
size:50 and column size:12

CSE101-Computer Programming
 Initializing Arrays
• Array is same as the variable can prompt for
value from the user at run time.
• Array is a group of elements so we use for
loop to get the values of every element
instead of getting single value at a time.
• Example: int array[5]; // array of size 5
for(int i=0;i<5;i++){// loop begins from
0 to 4
cin>>array[i];
}
@LPU CSE202 C++ Programming
2D-Array
A two – dimensional array can be seen as a table with ‘x’ rows and
‘y’ columns where the row number ranges from 0 to (x-1) and
column number ranges from 0 to (y-1). A two – dimensional array
‘x’ with 3 rows and 3 columns is shown below:

Examples:
Representing the marks of 60 students of class in 5 subjects, we
can take a 2D array of row size:60 and column size:5
Representing the sales done by all(50) sales persons of a
particular branch for all months(12), we can take a 2D array of row
size:50 and column size:12

CSE101-Computer Programming
 Operations on arrays
• Insertion of element into an array
• Deletion of element from an array
• Search of element in an array
• Linear search
• Binary Search
• Sorting

@LPU CSE202 C++ Programming

Pass Array to function
 Bubble sort Comparing
successive elements

77 56 4 10 34 2 Original array

56 4 10 34 2 77 After pass 1
4 10 34 2 56 77 After pass 2
4 10 2 34 56 77 After pass 3
4 2 10 34 56 77 After pass 4
2 4 10 34 56 77 After pass 5

Total number of pass required for sorting: n-1

 Program of
Initializing an
array to zero
using loop.

@LPU CSE202 C++ Programming

 Element Value
0 0
1 0
2 0
3 0
4 0
5 0 n[0]
n[1] 0
6 0
n[2] 0
7 0
n[3] 0
8 0
n[4] 0
9 0
n[5] 0
n[6] 0
n[7] 0
n[8] 0
n[9] 0

@LPU CSE202 C++ Programming

 Program of
Initializing an
array element
with
calculations
using loop.

@LPU CSE202 C++ Programming

 Element Value
0 2
1 4
2 6
3 8
4 10 n[0]
n[1] 4
5 12 6
n[2]
6 14 n[3] 8
7 16 n[4] 10
8 18 n[5] 12
n[6] 14
9 20
n[7] 16
n[8] 18
n[9] 20

@LPU CSE202 C++ Programming

 Operations on arrays
• Insertion of element into an array
• Deletion of element from an array
• Search of element in an array
• Linear search
• Binary Search
• Sorting

@LPU CSE202 C++ Programming

 #include<iostream>
using namespace std;

{
int main() • Program to
int a[100],i,n,k,
item; insert an
element
cout<<"how many
no to store in
array";
cin>>n;
cout<<"Enter the number";
into an
for(i=0;i<=n-1;i++)
cin>>a[i]; array
cout<<"Enter the no. and its position";
cin>>tem>>k;
k=k-1;
for(i=n-1;i>=k;i--)
{
a[i+1]=a[i];
}
a[k]=item;
cout<<"Contents of
the array\n"; for(i=0;i<=n;i++)
{
cout<<a[i];
}
return 0;
@LPU CSE202 C++ Programming}
 How many no to store in array: 4
Enter the number: 12
14
Output
5
11
Enter the no. and the position: 20 3
Content of the array
12
14
5
20
11

@LPU CSE202 C++ Programming

 #include<iostream>
using namespace std;
int main()
{
int a[100],i,n,k;
• Program to
cout<<"how many
no to store in delete an
array"<<endl;
cin>>n;
cout<<"enter the number"<<endl;
element
for(i=0;i<n;i++)
cin>>a[i];
from an
cout<<"enter the position";
cin>>k; array
k=k-1;
for(i=k;i<n;i++)
{
a[i]=a[i+1];
}
cout<<"contents of the array"<<endl;
for(i=0;i<n-1;i++)
{
cout<<a[i];
}
getch();
}

@LPU CSE202 C++ Programming

 How many no to store in array: 4
Enter the number: 12
14
Output
5
11
Enter the position: 3
Content of the array
12
14
11

@LPU CSE202 C++ Programming

CSE101-Computer Programming
CSE101-Computer Programming
 Searching in Arrays
• The process of finding a particular element of
an array is called searching.
• Search an array for a key value.
• Two searching techniques:
– Linear search
– Binary search

@LPU CSE202 C++ Programming

 Linear search
• Linear search
– Simple
– Compare each element of array with key value
– Useful for small and unsorted arrays
• It simply examines each element sequentially,
starting with the first element, until it finds the
key element or it reaches the end of the array.
Example: If you were looking for someone on a
moving passenger train, you would use a
sequential search.

@LPU CSE202 C++ Programming

 #include<iostream>
using namespace std;
int main()
{
int a[20],key,i,n, c=-
• Program of
1;
cout<<“Enter the number of elements:\t"; linear
cin>>n;
cout<<"Enter the elements:\t";
for(i=0;i<n;i++)
search in an
cin>>a[i];
cout<<"Enter the element to be found \t";
array.
cin>>key;
for(i=0;i<n;i++)
if(a[i]==key) //comparison
{
cout<<“Key found at location \t"<<i;
c++;
break;
}
if (c==-1)
cout<<"element not found in the
list";
return 0;
}

@LPU CSE202 C++ Programming

 Enter the number of elements: 4
Enter the element: 12 Output
14
5
11
Enter a number to be found: 14
Key found at location 2

@LPU CSE202 C++ Programming

 Binary search
• Binary search
– Applicable for sorted arrays
• The algorithm locates the middle element of
the array and compares it to the key value.
– Compares middle element with the key
• If equal, match found
• If key < middle, looks in left half of middle
• If key > middle, looks in right half of middle
• Repeat (the algorithm is repeated on one-quarter
of the original array.)

@LPU CSE202 C++ Programming

 Binary search
– It repeatedly divides the sequence in two, each
time restricting the search to the half that would
contain the element.
– This is a tremendous increase in performance over
the linear search that required comparing the
search key to an average of half of the array
elements.
– You might use the binary search to look up a word
in a dictionary

@LPU CSE202 C++ Programming

 #include<iostream>
using namespace std;
int main()
{
int ar[100],beg,mid,end,i,n,search;
cout<<"How many numbers in the array: ";
• Program of
cin>>n;
cout<<"Enter "<<n<<" numbers in ascending order --> ";
binary
for(i=0;i<n;i++)
cin>>ar[i]; search in an
beg=0;end=n-1;
cout<<"Enter a number
to search: "; cin>>search;
array.
while(beg<=end)
{
mid=(beg+
end)/2;
if(ar[mid]=
=search)
cout<<"\nItem found at position"<<(mid+1);
if(search>ar[mid])
beg=mid+1;
else
} end=mid-1;
cout<<"\nSorry! "<<search<<" doesnot found.";
return 0;
}

@LPU CSE202 C++ Programming

 How many numbers in the array: 4
Enter 4 numbers in ascending order12
14
Output
26
47
Enter a number to search:26
Item found at position 3

@LPU CSE202 C++ Programming