Java array search for matching string

Question

how to optimize the following:

final String[] longStringArray = {"1","2","3".....,"9999999"};
String searchingFor = "9999998"
for(String s : longStringArray)
    {
        if(searchingFor.equals(s))
        {
            //After 9999998 iterations finally found it
            // Do the rest of stuff here (not relevant to the string/array)
        }
    }

NOTE : longStringArray is checked only once during runtime and is not sorted and changes every time I run the program.

I am sure there is a way to improve the worst case performance here, but I cannot find it ...

PS I would also appreciate a solution in which the string searchFor does not exist in the longStringArray array.

Thank.

Answer 1

, , , , , O (N). , , , O (N), - . .

:

• , . O (log N).
• , HashSet<String>. O (1) ( ).

Answer 2

import org.apache.commons.lang.ArrayUtils;
ArrayUtils.indexOf(array, string);

ArrayUtils

Answer 3

- .

. , , , .

B-tree, , , .

Answer 4

Arrays.asList(longStringArray).Contains(searchingFor)