// 11/18/2019
// Searching an array. V2 puts search into a method

import java.util.Scanner;

public class SearchingV2 {
  public static void main(String[] args) {
   
    int[] numbers = {4, 6, 8, 10, 12};
    int val;
    Scanner sc = new Scanner(System.in);
    System.out.println("What value do you want to search for?");
    val = sc.nextInt();
    if (linearSearch(numbers, val))
      System.out.println(val + " is found.");
    else
      System.out.println(val + " is NOT found.");
    int k = linearSearch2(numbers, val);
    if (k!=-1)
      System.out.println("found at loc " + k);
    else
      System.out.println(val + " is NOT found.");
  }
  /** linear search in a method 
    * @param num is the value to search for in arr
    * @param arr is the array to search
      @return true if value is found
    */
  public static boolean linearSearch(int[] arr, int num) {
    boolean found = false;
    for (int i=0; i<arr.length; i++) {
      if (num == arr[i]){
        found = true;
      }
    }
    return found;
  }
  /** linear search method 2, to return INDEX
    * @param num is the value to search for in arr
    * @param arr is the array to search
      @return index of value if found,
      -1 if not found
    */
  public static int linearSearch2(int[] arr, int num) {
    int foundIndex = -1;
    for (int i=0; i<arr.length; i++) {
      if (num == arr[i]){
        foundIndex = i;
        // return i;
      }
    }
    return foundIndex;
  }
}

/** LAB: Write a method to search an array and tell
  * whether the array has a value that is divisible
  * by some integer that the user enters.
  * 
  */