package linsearch; public class Main { public static int search(int[] a, int x) { int n = a.length; int i = 0; int r = -1; while (i < n && r == -1) { if (a[i] == x) r = i; i = i+1; } return r; } }