Linear search between two arrays

Question

I'm having trouble with the comparison of an array of football teams and an array of team names that may or may not be in the football team array. I have read both .txt files into their own arrays and parsed the team array with substring in order to isolate the team name. I know I can read both the search array and the team names individually because I tested it with a println. I think my problem is in the comparison "if" statement.
    public void seqSearch()//Sequential(linear) search
    int j=0, s;
    //int m = j+1;
        for(s=0; s<searchSize; s++)//increments through the search array
          for(j=0; j<teamArray.length; j++)//increments through the team array
           if(teamArray[j].getName().equals(search[s]))//I think this is where the problem is
               System.out.println("Found " + teamArray[j].getName() + "after" + j + "searches.");
               break;                 
           else
               System.out.println(teamArray[j].getName());//prints through all of the names during each search for testing
               if(j == teamArray.length-1)
                   System.out.println("Can't find " + search[s] + " after " + j + " searches");
        }//end for
    }//end seqSearch()My output prints the names of each team on their own line and at the end it always says that it can't find each search term.
Ex.
Bears
Bengals
Bills
Vikings
Can't find Bills after 32 searches
Bears
Bengals
Bills
Vikings
Can't find Eagles after 32 searches
etc
I though that .equals was the way to compare in this situation. Any idea what I'm doing wrong?

Answer 1

Dave,
teamArray[j].getName().equals(search[s]))what is the implementation class which is returned from "search[s]" and from "eamArray[j].getName()"
if both of them are java.lang.String then us "equalsIgnoreCase" instead of "equals"
if the implementation class is different, then you have to override the equal method and implement your own.
Regards,
Alan Mehio
London, UK