1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
11.
12.
13.
14.
15.
|
It is ordered data collection
Data Can be accessed based on index value
Stack operations performed using push,pop,shift,unshift
Duplicate Elements will be exist in Array
For Large data, Arrays will not be in speed as getting values from
hash keys.
Arrays can be created using () brackets @array=(1,3,5,6,2);
For More methods refer this link.
for accessing array index
$array[1];
Array can be accessed in loops as below
1.For(@array)
{
}
2.foreach(@array1,@array2)
{
Print $_;
}
3.print grep{},@array;
4. print map{},@array;
Array slices can be used as below
@array[2];
To find length of an array
$#array+1;
or
scalar(@array);
or
$a=@array;
For Emptying Array
$#array = -1;
or
@array = ( );
To reverse an array
print reverse @array;
To sort array Elements
ascending order
@a=sort{$a <=> $b }@array;
desending order
@a=sort{$b <=> $a }@array;
To add array elements
$array[0]='55';
To Delete array elements
delete $array[1];
|
It is unordered Data Collection
Data Can be accessed based on Key value
Stack operations cannot be performed
Keys will not have Duplicate elements but Values would have Duplicate
elements.
Based on hash Keys Data retrival would be fast
For accessing hash index use the key name
$hash{1};
Hash can be accessed based on keys and values
While(($k,$vals) = each %h)
{
Print “$k,$vals\n”;
}
Foreach $k (keys %h)
{
Print “$k => $hash{$k}\n”;
}
Foreach $values (values %hash)
{
Print “$values\n”;
}
Hash slices can be used as below,
$hash{'1'}
To find length of hash
@array=keys %hash;
scalar(@array);
or
$#array+1;
or
$a=@array;
For Emptying hash
%hash=( );
To reverse a hash
print reverse %hash;
To sort hash elements
foreach $k (sort keys %hash)
{
print "$k => $hash{$k}\n";
}
To add hash Elements
$hash{1}='one';
To Delete hash elements
delete($hash{'1'});
|
