package suganthan;
public class Arrayprac3 {
void linear_search(int a[])
{
int linear=3;
int a1=0;
for(int i=0;i<a.length;i++)
{
if(a[i]==linear)
{
a1=a[i];
}
}
if(a1==linear)
{
System.out.println(“its linear”);
}
else
{
System.out.println(“not linear”);
}
}
void ele(int a[])
{
int pre=2;
int count=0;
for(int i=0;i<a.length;i++)
{
if(a[i]==pre)
{
count++;
}
}
System.out.println(“how many times give element is present is” +count);
}
void finding_index(int a[])
{
int index=4;
int a2=0;
for(int i=0;i<a.length;i++)
{
if(a[i]==index)
{
a2=i;
}
}
System.out.println(“Index of given number is”+ a2);
}
void removing_index(int a[])
{
int index=4;
for(int i=0;i<a.length;i++)
{
if(a[i]==index)
{
continue;
}
System.out.println(a[i]);
}
}
void placing_index(int a[])
{
int index=6;
int pos=a.length;
for(int i=0;i<=a.length-1;i++)
{
if(a[i]==pos)
{
System.out.println(index);
}
System.out.println(a[i]);
}
}
void duplicate_count(int a[])
{
int index=2;
int count=0;
for(int i=0;i<=a.length-1;i++)
{
if(a[i]==index)
{
count++;
}
}
System.out.println(count);
}
public static void main(String[] args) {
Arrayprac3 a2=new Arrayprac3();
int a[]= {1,2,3,4,5};
a2.linear_search(a);
int a1[]= {10,2,3,2,2,2,28};
a2.ele(a1);
int a3[]= {2,3,5,4,6,7};
a2.finding_index(a3);
int a4[]= {2,3,5,4,6,7};
a2.removing_index(a4);
int a5[]= {1,2,3,4,5};
a2.placing_index(a5);
int a6[]= {1,2,2,2,2,3,4,5,2};
a2.duplicate_count(a6);
}
}
output;
its linear
how many times give element is present is4
Index of given number is3
removing index
2
3
5
6
7
adding last index
1
2
3
4
6
5
duplicate number array
5
Site Title 