-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathLinearSearch.java
More file actions
32 lines (26 loc) · 877 Bytes
/
LinearSearch.java
File metadata and controls
32 lines (26 loc) · 877 Bytes
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
package Algorithms.Searching;
import java.util.Arrays;
import java.util.Random;
/**
* @author Srinvas Vadige, srinivas.vadige@gmail.com
* @since 21 Sept 2024
*/
public class LinearSearch {
public static void main(String[] args) {
Random random = new Random();
int[] intArr = new int[100];
for (int i = 0; i < 100; i++)
intArr[i] = random.nextInt(1, 100);
System.out.println("Input Array: " + Arrays.toString(intArr));
int target = random.nextInt(1, 100);
int targetIdex = search(intArr, target);
System.out.println("target is: "+ target + " and it's index after the linear search is: "+targetIdex);
}
static int search(int[] intArr, int target){
for (int i=0; i<intArr.length; i++) {
if(intArr[i] == target)
return i;
}
return -1;
}
}