Scribd
Upload
22 views10 pages

Array Comparison and Insertion Methods

The document discusses array equality in Java, demonstrating how to compare two arrays for equality based on element positions. It also covers methods for inserting and deleting elements in arrays, including inserting at specific locations and deleting elements at given indices. The document provides code examples and outputs for each operation, illustrating how to manipulate arrays effectively.

Uploaded by

Rehan Hussain
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
22 views10 pages

Array Comparison and Insertion Methods

The document discusses array equality in Java, demonstrating how to compare two arrays for equality based on element positions. It also covers methods for inserting and deleting elements in arrays, including inserting at specific locations and deleting elements at given indices. The document provides code examples and outputs for each operation, illustrating how to manipulate arrays effectively.

Uploaded by

Rehan Hussain
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

DURGASOFT

4===>777
[111, 222, 333, 999, 777]

equality of two arrays:


~~~~~~~~~~~~~~~~~~~~~~~
two arrays are said to equal iff each element present in the first array must be existed
in the second also with same positions.

version1:
---------
Ex1:
[10, 20, 30]
[11, 12, 13]
false

Ex2:
[10, 20, 30]
[10, 11, 12]
1st com--> ok
2nd com
false
Ex3:
[10, 20, 30]
[10, 20, 30]
1sr com --> ok
2nd com --> ok
3rd com --> ok

{
for(i=0;i<[Link];i++)
{
if(a[i]!=b[i])
return false;
}
return true;
}

Ex:
[10,20,30]
[20,10,30]
aren't these equal
DURGASOFT, # 202, 2nd Floor, HUDA Maitrivanam, Ameerpet, Hyderabad - 500038,
131  88 85 25 26 27, 72 07 21 24 27/28 | [Link]
Maii: durgasoftonline@[Link]
DURGASOFT
w.r.t position ---> false
ignore position --> true (sort both arrays)

import [Link].*;

class Demo
{
static boolean equals(int a[],int b[])
{
for(int i=0;i<[Link];i++)
{
if(a[i]!=b[i])
return false;
}
return true;
}
}

class Test
{
public static void main(String[] args)
{
[Link]([Link](new int[]{1,2,3},new
int[]{1,2,3}));//true
[Link]([Link](new int[]{1,2,3},new
int[]{4,5,6}));//false
[Link]([Link](new int[]{1,2,3},new
int[]{3,2,1}));//false
}
}

output:
-------
true
false
false

Ex:
import [Link].*;

class Demo
{
DURGASOFT, # 202, 2nd Floor, HUDA Maitrivanam, Ameerpet, Hyderabad - 500038,
132  88 85 25 26 27, 72 07 21 24 27/28 | [Link]
Maii: durgasoftonline@[Link]
DURGASOFT
static boolean equals(int a[],int b[])
{
for(int i=0;i<[Link];i++)
{
if(a[i]!=b[i])
return false;
}
return true;
}
}

class Test
{
public static void main(String[] args)
{
[Link]([Link](new int[]{1,2,3},new
int[]{1,2,3}));//true
[Link]([Link](new int[]{1,2,3},new
int[]{4,5,6}));//false
[Link]([Link](new int[]{1,2,3},new
int[]{3,2,1}));//false
int a[] = {1,2,3};
int b[] = {3,2,1};
[Link]([Link](a,b));//false
[Link](a);
[Link](b);
[Link]([Link](a,b));//true
}
}

output:
-------
true
false
false
false
true

version2:
---------
we have predefined method is existed for arrays comaprision

[Link](a,b);
DURGASOFT, # 202, 2nd Floor, HUDA Maitrivanam, Ameerpet, Hyderabad - 500038,
133  88 85 25 26 27, 72 07 21 24 27/28 | [Link]
Maii: durgasoftonline@[Link]
DURGASOFT
Ex:
import [Link].*;

class Demo
{
}

class Test
{
public static void main(String[] args)
{
int a[] = {1,2,3};
int b[] = {3,2,1};
[Link]([Link](a,b));//false
[Link](a);
[Link](b);
[Link]([Link](a,b));//true
}
}

output:
-------
false
true

inserting an element into an array


~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
case1: inserting an element into an array at last position
----------------------------------------------------------
import [Link].*;

class Demo
{
static int[] insertAtLast(int a[],int element)
{
int i,b[] = new int[[Link]+1];
for(i=0;i<[Link];i++)
{
b[i] = a[i];
}
b[i] = element;
DURGASOFT, # 202, 2nd Floor, HUDA Maitrivanam, Ameerpet, Hyderabad - 500038,
134  88 85 25 26 27, 72 07 21 24 27/28 | [Link]
Maii: durgasoftonline@[Link]
DURGASOFT
return b;
}
}

class Test
{
public static void main(String[] args)
{
int a[] = {10,20,30,40,50};
[Link]([Link](a));
[Link]([Link]([Link](a,60)));
}
}

output:
-------
[10, 20, 30, 40, 50]
[10, 20, 30, 40, 50, 60]

case2: inserting an element at frist location


---------------------------------------------
import [Link].*;

class Demo
{
static int[] insertAtLast(int a[],int element)
{
int i,b[] = new int[[Link]+1];
for(i=0;i<[Link];i++)
{
b[i] = a[i];
}
b[i] = element;
return b;
}
static int[] insertAtFirst(int a[],int element)
{
int i,b[] = new int[[Link]+1];
b[0] = element;
for(i=0;i<[Link];i++)
{
b[i+1] = a[i];
DURGASOFT, # 202, 2nd Floor, HUDA Maitrivanam, Ameerpet, Hyderabad - 500038,
135  88 85 25 26 27, 72 07 21 24 27/28 | [Link]
Maii: durgasoftonline@[Link]
DURGASOFT
}
return b;
}
}

class Test
{
public static void main(String[] args)
{
int a[] = {10,20,30,40,50};
[Link]([Link](a));
//[Link]([Link]([Link](a,60)));
[Link]([Link]([Link](a,5)));
}
}

output:
-------
[10, 20, 30, 40, 50]
[5, 10, 20, 30, 40, 50]

case3: inserting an element at given location


---------------------------------------------
import [Link].*;

class Demo
{
static int[] insertAtLast(int a[],int element)
{
int i,b[] = new int[[Link]+1];
for(i=0;i<[Link];i++)
{
b[i] = a[i];
}
b[i] = element;
return b;
}
static int[] insertAtFirst(int a[],int element)
{
int i,b[] = new int[[Link]+1];
b[0] = element;
for(i=0;i<[Link];i++)
{
DURGASOFT, # 202, 2nd Floor, HUDA Maitrivanam, Ameerpet, Hyderabad - 500038,
136  88 85 25 26 27, 72 07 21 24 27/28 | [Link]
Maii: durgasoftonline@[Link]
DURGASOFT
b[i+1] = a[i];
}
return b;
}
static int[] insertAtLocation(int a[],int element,int location)
{
int i,k=0,b[] = new int[[Link]+1];
for(i=0;i<location;i++)
b[k++]=a[i];
b[k++]=element;
for(i=location;i<[Link];i++)
b[k++]=a[i];
return b;
}
}

class Test
{
public static void main(String[] args)
{
int a[] = {10,20,30,40,50};
[Link]([Link](a));
//[Link]([Link]([Link](a,60)));
//[Link]([Link]([Link](a,5)));
[Link]([Link]([Link](a,999,0)));
[Link]([Link]([Link](a,999,1)));
[Link]([Link]([Link](a,999,2)));
[Link]([Link]([Link](a,999,3)));
[Link]([Link]([Link](a,999,4)));
}
}

output:
-------
[10, 20, 30, 40, 50]
[999, 10, 20, 30, 40, 50]
[10, 999, 20, 30, 40, 50]
[10, 20, 999, 30, 40, 50]
[10, 20, 30, 999, 40, 50]
[10, 20, 30, 40, 999, 50]

DURGASOFT, # 202, 2nd Floor, HUDA Maitrivanam, Ameerpet, Hyderabad - 500038,


137  88 85 25 26 27, 72 07 21 24 27/28 | [Link]
Maii: durgasoftonline@[Link]
DURGASOFT
DELETING AN ELEMENT FROM AN ARRAY
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
case1: deleting an element located at the given location
--------------------------------------------------------
import [Link].*;

class Demo
{
static int[] deleteElementAtLocation(int a[],int location)
{
int k=0,i,b[] = new int[[Link]-1];
for(i=0;i<[Link];i++)
{
if(i==location)
continue;
b[k++]=a[i];
}
return b;
}
}
class Test
{
public static void main(String[] args)
{
int a[] = {10,11,12,13,14,15};
[Link]([Link](a));

[Link]([Link]([Link](a,0)));

[Link]([Link]([Link](a,1)));

[Link]([Link]([Link](a,2)));

[Link]([Link]([Link](a,3)));

[Link]([Link]([Link](a,4)));

[Link]([Link]([Link](a,5)));
}
}

output:
DURGASOFT, # 202, 2nd Floor, HUDA Maitrivanam, Ameerpet, Hyderabad - 500038,
138  88 85 25 26 27, 72 07 21 24 27/28 | [Link]
Maii: durgasoftonline@[Link]
DURGASOFT
-------
[10, 11, 12, 13, 14, 15]
[11, 12, 13, 14, 15]
[10, 12, 13, 14, 15]
[10, 11, 13, 14, 15]
[10, 11, 12, 14, 15]
[10, 11, 12, 13, 15]
[10, 11, 12, 13, 14]

case2: delete all elements in an array


---------------------------------------
import [Link].*;

class Demo
{
static int[] deleteElementAtLocation(int a[],int location)
{
int k=0,i,b[] = new int[[Link]-1];
for(i=0;i<[Link];i++)
{
if(i==location)
continue;
b[k++]=a[i];
}
return b;
}
static int[] deleteAll(int a[]){
int b[]=new int[0];
return b;
}
}
class Test
{
public static void main(String[] args)
{
int a[] = {10,11,12,13,14,15};
[Link]([Link](a));

[Link]([Link]([Link](a,0)));

[Link]([Link]([Link](a,1)));

[Link]([Link]([Link](a,2)));
DURGASOFT, # 202, 2nd Floor, HUDA Maitrivanam, Ameerpet, Hyderabad - 500038,
139  88 85 25 26 27, 72 07 21 24 27/28 | [Link]
Maii: durgasoftonline@[Link]
DURGASOFT
[Link]([Link]([Link](a,3)));

[Link]([Link]([Link](a,4)));

[Link]([Link]([Link](a,5)));
[Link]([Link]([Link](a)));
}
}

output:
-------
[10, 11, 12, 13, 14, 15]
[11, 12, 13, 14, 15]
[10, 12, 13, 14, 15]
[10, 11, 13, 14, 15]
[10, 11, 12, 14, 15]
[10, 11, 12, 13, 15]
[10, 11, 12, 13, 14]
[]

case3: deleting an element from an array


----------------------------------------
import [Link].*;

class Demo
{
static int[] deleteElementAtLocation(int a[],int location)
{
int k=0,i,b[] = new int[[Link]-1];
for(i=0;i<[Link];i++)
{
if(i==location)
continue;
b[k++]=a[i];
}
return b;
}
static int[] deleteAll(int a[]){
a=new int[0];
return a;
}
DURGASOFT, # 202, 2nd Floor, HUDA Maitrivanam, Ameerpet, Hyderabad - 500038,
140  88 85 25 26 27, 72 07 21 24 27/28 | [Link]
Maii: durgasoftonline@[Link]

You might also like