-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathLinear_Search.java
More file actions
29 lines (27 loc) · 1.17 KB
/
Linear_Search.java
File metadata and controls
29 lines (27 loc) · 1.17 KB
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
import java.util.Scanner;
public class Linear_Search {
int array[] = {
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, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52,
53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69,
71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87,
88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100,101,70, 102, 103,
};
public void lineaSearch(){
int size = array.length;
Scanner scanner = new Scanner(System.in);
int value;
System.out.println("Please enter the number you want to search for using the linear approach");
value = scanner.nextInt();
Linear_Search linear1 = new Linear_Search();
for (int i=0 ;i< size-1; i++){
if(array[i]==value){
System.out.println("Number found is at index :"+ i);
break;
}else{
System.out.println("The number entered cannot found");
}
}
}
}