Finding a local minimum

Question

im trying to write some code that can find the local minimums in an array of integers. for example in
[8 7 6 5 4 5] the 4 would be a local min. Heres my code so far
public class Localmin
    public static void main (String args[])
        int[] array = {10,9,8,7,6,5,4,3,2,3};
        int x;
        int counter = 0;       
        for(int i = 1; i < array.length-1; i++)
            if(array[ i ] <= array[ i-1] && array[ i ] <= array[ i+1 ])
                x = array; //saves minimum position
counter++; //saves number of minimums found
else
x = array.length-1;
System.out.println("minimum is at: " +x);       
Compiling this above it says 'x has not been initialized', and when I include the print statement inside the for loop, it gives an array out of bound message.
But if I run the loop with just x = array[i] then it prints each statement with no problems. I think the if statement must be incorrect, but I cant spot a fault. Can anyone see what the problem is?
-t

Answer 1

couldnt find an edit button, thats last bit was supposed to be:
But if I run the loop with just x = array[i| then it prints each statement with no problems. I think the if statement above must be incorrect, but I cant spot a fault. Can anyone see what the problem is?
and for my example [8 7 6 5 4 5], the 4 would be a local min as the 2 numbers either side of it are greater. (the 1st and last variables in an array cant be mins as they have nothing to compare to on one of their sides).