# Sequential Search

Let's dive into search functionality. Sequential search is a basic form of searching that checks if an element is present in a given list. This method will return a value telling us whether or not the searched value is in the given list. Take a look at the code below, where we have a method that searches through the array for integer '4'.

SequentialSearchExample.java
``````package exlcode;

public class SequentialSearchExample {

public static void main(String[] args) {
int[] exampleVariableOne = {2, 9, 6, 7, 4, 5, 3, 0, 1};
int target = 4;
sequentialSearch(exampleVariableOne, target);
}

public static void sequentialSearch(int[] parameterOne, int parameterTwo) {
int index = -1;
// searches each index of the array until it reaches the last index
for (int i = 0; i < parameterOne.length; i++) {
if (parameterOne[i] == parameterTwo) {
// if the target is found, int index is set as the value of i and
// the for loop is terminated
index = i;
break;
}
}
if (index == -1) {
System.out.println("Your target integer does not exist in the array");
} else {
System.out.println("Your target integer is in index " + index + " of the array");
}
}
}``````

The sequential search uses a concept we have already mastered, `for` or `while` loops that search for a specified integer in an array. The concept is called "sequential search" as it goes through the elements starting from the first one, indexed "0", all the way through to the final index. Once the search runs, it returns the index of the targeted value if the targeted value exists in the array. This search functionality can be used on any type of "array" or `ArrayList`, but it may not be your preferred way of searching once you learn about other search methods in the future.

#### Application Question

Which of the following will cause the longest execution of a sequential search looking for a value in an array of 100 integers?