-
Notifications
You must be signed in to change notification settings - Fork 27
/
linear search technique.java
42 lines (35 loc) · 1.29 KB
/
linear search technique.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
42
import java.util.*;
public class LinearSearch {
public static void main(String args[]) {
// taking user input
Scanner sc = new Scanner(System.in);
System.out.println("Enter number of elements:");
int N = sc.nextInt();
System.out.println("Enter elements:");
// storing elements in an array
int[] arr = new int[N];
for(int i=0;i<N;i++){
arr[i] = sc.nextInt();
}
// asking user for target element
System.out.println("Enter target element:");
int target = sc.nextInt();
// using linear search to find element
int index = Search(N, arr, target);
// printing result
System.out.println("The array is as follows:\n" + arr.toString());
if(index == -1)
System.out.println("Sorry, element not found");
else
System.out.println("The element is present at index "+index);
}
public static int Search(int N, int[] arr, int target){
// using for loop to traverse the array
for(int i=0; i<N; i++){
// if target is found return
if(arr[i] == target) return i+1;
}
// if the target is not present return
return -1;
}
}