Simplest example of Linear Search in java

LinearSearchClass.java

package dorid;

import java.awt.LinearGradientPaint;

public class LinearSearchClass {
	static int [] numAarray;

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		numAarray=new int[]{3,2,4,5,6,6,7,8,9,9,0,9};
		int result= LinearSearch(numAarray, 7);
		if(result==-1)
		{
			System.out.print("not in array");

			
		}
		else
		System.out.print("Number found at index "+result);
	
		
		

	}
	private static int LinearSearch(int [] array,int search)
	{
		for(int i=0;i<array.length;i++)
		{
			if(array[i]==search)
			{
				return i;
				
			}
			
		}
		return -1;
		
	}

}