Implementing the sequential search algorithm in java

Problem:

The sequential search (also called the linear search) is the simplest search algorithm. It is also
the least efficient. It simply examines each element sequentially, starting with the first element,
until it finds the key element or it reaches the end of the array.
If you were looking for someone on a moving passenger train, you would use a sequential
search.
Here is the sequential search algorithm:
(Postcondition: either the index i is returned where si
= x, or 1 is returned.)
1. Repeat steps 2 3, for i = 0 to n 1.
2. (Invariant: none of the elements in the subsequence {s0...si–1} is equal to x.)
3. If si = x, return i.
4. Return 1.
Implement the sequential search algorithm

Output:

{22, 33, 44, 55, 66, 77, 88, 99}
search(a, 44): 2
search(a, 50): -1
search(a, 77): 5
search(a, 100): -1

Solution:

public class TestBinarySearch {
public static void main(String[] args) {
int[] a = {22, 33, 44, 55, 66, 77, 88, 99};
ch02.ex02.DuplicatingArrays.print(a);
System.out.println("search(a, 44): " + search(a, 44));
System.out.println("search(a, 50): " + search(a, 50));
System.out.println("search(a, 77): " + search(a, 77));
System.out.println("search(a, 100): " + search(a, 100));
}
public static int search(int[] a, int x) {
// POSTCONDITIONS: returns an integer i; 
// if i >= 0, then a[i] == x; otherwise x is not in a[];
for (int i=0; i<a.length; i++) { // step 1
// INVARIANT: x is not among a[0]...a[i-1] // step 2
if (a[i] == x) { // step 3
return i;
}
}
return -1; // step 4
}
}