-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathArraySearch.java
More file actions
98 lines (71 loc) · 1.66 KB
/
ArraySearch.java
File metadata and controls
98 lines (71 loc) · 1.66 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
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
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
package IntrotoDSwithJava;
import java.util.Arrays;
import java.util.Scanner;
public class ArraySearch {
int[] arr;
int capacity;
ArraySearch(int n, char c){
arr = new int[n];
capacity = n;
if(c =='M'){
populate();
} else {
populateAuto();
}
}
void populate(){
Scanner sc = new Scanner(System.in);
for(int i=0;i < capacity;i++){
int input;
System.out.println("Enter a valid number: ");
input = sc.nextInt();
arr[i] = input;
}
}
void populateAuto(){
for(int i=0;i < capacity;i++){
int input = (int) (Math.random() * 100);
arr[i] = input;
}
}
// void populate(){
//
// for(int i =0; i< 9;i++){
// arr[i] = (int) (Math.random() * 10);
// }
//
// }
/**
* @param search
* @return Ordered array
*
*/
boolean linearsearch(int search){
int i = 0;
while( (i < capacity) && (arr[i] != search)) {
i++;
if(i == capacity) return false;
}
return true;
}
boolean binarysearch(int search){
return false;
}
int[] selectionsort(int[] arr){
return arr;
}
int[] insertsort(int[] arr){
return arr;
}
int[] mergesort(int[] arr){
return arr;
}
void printarr(){
System.out.println(Arrays.toString(arr));
}
public static void main(String[] args) {
ArraySearch arr = new ArraySearch(10 , 'A');
arr.printarr();
System.out.println(arr.linearsearch(300));
}
}