Linear Search is the simplest searching algorithm which compares the search element with every value until the desired element is found.
Java
import java.util.*;
public class LinearSearch
{
public static void main(String args[])
{
int size=0,element=0,flag=0;
Scanner sc=new Scanner(System.in);
System.out.print("Enter array size: ");
size=sc.nextInt();
int ar[]=new int[size];
System.out.println("Enter array elements:-");
for(int i=0;i<size;i++)
{
ar[i]=sc.nextInt();
}
System.out.print("Enter search element: ");
element=sc.nextInt();
for(int i=0;i<size;i++)
{
if(element==ar[i])
{
flag=1;
}
}
if(flag==1)
{
System.out.println("The element is found in the array");
}
else
{
System.out.println("The element does not exist in the array");
}
}
}Java