-
Notifications
You must be signed in to change notification settings - Fork 0
/
LinearSearch.java
41 lines (31 loc) · 933 Bytes
/
LinearSearch.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
import java.util.*;
public class LinearSearch
{
public static void main(String arg[])
{
Scanner sc = new Scanner(System.in);
System.out.print("Enter the number of elements: ");
int n = sc.nextInt();
int arr[] = new int[n];
for(int i = 0; i < n; i++)
{
System.out.print("Enter element: ");
arr[i] = sc.nextInt();
}
System.out.println();
System.out.println("Enter the Key to be found: ");
int key = sc.nextInt();
System.out.println();
LinearSearch linear = new LinearSearch();
linear.search(arr,key);
sc.close();
}
public void search(int arr[],int key)
{
for(int i = 0; i < arr.length; i++)
{
if(key == arr[i])
System.out.println("Found Key at: " + i + " index or at the " + (i+1) + "th posiition.");
}
}
}