LinearSearch.java

// Linear Search code 
public class LinearSearch
{
    public static void main (String[] args)
    {
        int[] nums = {23,45,1,2,8,19,-3,16,-11,28};
        int target = -3;
        int ans = linearSearch(nums,target);
        System.out.println(ans);
    }

    //search in the array : return the index if item found
    // otherwise if item not found return -1

    static int linearSearch(int[] arr , int target)
    {
        if(arr.length == 0)
        {
            return -1;
        }

        //run a for loop 
        for(int index = 0;index<arr.length;index++)
        {
            //check for the element at every index possible 
            int element = arr[index];
            if(element == target)
            {
                return index;
            }
            
        }
        return -1;
    }
}