-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathlinearsearch.java
More file actions
51 lines (46 loc) · 1.46 KB
/
linearsearch.java
File metadata and controls
51 lines (46 loc) · 1.46 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
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
import java.util.ArrayList;
public class linearsearch {
public static void main(String[] args) {
int[] arr = {1,2,3,4,5,6,7,7,8,9};
int target = 7;
int ans = search(arr,target,0);
// System.out.println(ans);
// System.out.println(search2(arr,target,0));
ArrayList<Integer> list = new ArrayList<Integer>();
// System.out.println(search3(arr,target,0,list));
System.out.println(search4(arr,target,0));
}
static int search(int[] arr,int target,int i){
if(arr[i]==target)
return i;
if(i==arr.length-1)
return -1;
return search(arr,target,++i);
}
static boolean search2(int[] arr,int target , int i){
if(i==arr.length)
return false;
return (arr[i]==target) || search2(arr,target,++i);
}
static ArrayList<Integer> search3(int[] arr,int target , int i, ArrayList<Integer> list2){
if(i==arr.length-1){
return list2;
}
if(target==arr[i]){
list2.add(i);
}
return search3(arr,target,++i,list2);
}
static ArrayList<Integer> search4(int[] arr,int target , int i){
ArrayList<Integer> list = new ArrayList<Integer>();
if(i==arr.length-1){
return list;
}
if(target==arr[i]){
list.add(i);
}
ArrayList<Integer> list2 = search4(arr,target,++i);
list.addAll(list2);
return list;
}
}