package
javaprgms;
import
java.util.Scanner;
public class
LinearSearch
{
public static void
main(String args[])
{
int c, n, search, array[];
Scanner in = new
Scanner(System.in);
System.out.println("Enter
number of elements");
n = in.nextInt();
array = new int[n];
System.out.println("Enter
" + n + " integers");
for (c =
0; c < n; c++)
array[c] = in.nextInt();
System.out.println("Enter
value to find");
search = in.nextInt();
for (c =
0; c < n; c++)
{
if (array[c] ==
search) /*
Searching element is present */
{
System.out.println(search + "
is present at location " + (c +
1) + ".");
break;
}
}
if (c == n) /* Searching element is
absent */
System.out.println(search + "
is not present in array.");
}
}
Output:
Enter number of
elements
4
Enter 4 integers
45
76
23
11
Enter value to find
7
7 is not present in
array.
No comments:
Post a Comment