Find Element x Using Linear Search

From CompSciWiki
Jump to: navigation, search

Back to the Program-A-Day homepage

Problem

Create a method that accepts an array of integers and a key value (integer) to determine whether or not the key value exists in the given array.

The method should return true if the key value was found in the array, otherwise the method should return false.

 

Array Algorithms

Wiki array03.jpg

Solution

Start by creating the method, this method should accept an array of integers and return an integer value.

 public static boolean elementExists(int[] array, int x) {

} 

You'll want to keep a boolean variable to keep track of whether or not you have found the key value x. At the beginning of your method, initialize this boolean variable to false since you have not yet found the key value.

 boolean exists = false;

return exists; 

Use a for loop to go through each element in the array to check if it is the value you're looking for.

 for(i = 0; i < array.length; i++) {

} 

Use an if statement to compare each element with the given key value x. In order to compare each element with x, use the '==' operator. If the current element is equal to the key value, that means you have found the element in the array, so you can set your boolean variable exists to true.

 if(array[i] == x) {
    exists = true;
} 

After the for loop, return your boolean exists variable.

 return exists; 

Putting everything together, here's what the entire method should look like:

 public static boolean elementExists(int[] array, int x) {
    int i; // loop iterator
    boolean exists = false;

    for(i = 0; i < array.length; i++) {
        if(array[i] == x) {
            exists = true;
        }
    }

    return exists;
} 

Code

Solution Code

Back to the Program-A-Day homepage