Java Algorithms Search Linear Search

Introduction

The linear search compares the key element sequentially with each element in the array.

It continues to do so until the key matches an element in the array or the array is exhausted.

  • If a match is found, the linear search returns the index of the element in the array that matches the key.
  • If no match is found, the search returns -1. 

public class Main {
  /** The method for finding a key in the list */
  public static int linearSearch(int[] list, int key) {
    for (int i = 0; i < list.length; i++) {
      if (key == list[i])
        return i;
    }/*  www .  j av  a 2s . c  om*/
    return -1;
  }

  public static void main(String[] args) {
    int[] list = { 11, 14, 4, 12, 5, -3, 16, 2 };
    int i = linearSearch(list, 4);
    System.out.println(i);
    int j = linearSearch(list, -4);
    System.out.println(j);
    int k = linearSearch(list, -3);
    System.out.println(k);
  }
}



PreviousNext

Related