1

boolean find( String[] theList, String toFind ) { for ( int i = 0; i < theList.length; i += 1 ) { if ( theList[i].equals( toFind )) { return true; } } return false; }

Which of the following are true for the above find() method? Select all that apply:

A.The worst case, best case, and average case have nearly the same steps (within a few steps)

B.The best case is much better than the worst case

C.The average case is better than the worst case, but not as good as the best case

D.The worst cast has linear run-time based on the # of times evaluated

E.The worst cast has parabolic run-time based on the # of times evaluated

2

boolean find( String[] theList, String toFind ) { boolean found = false; for ( int i = 0; i < theList.length; i += 1 ) { if ( theList[i].equals( toFind )) { found = true; } }

return found; }

Which of the following are true for the above find() method? Select all that apply:

A.The worst case, best case, and average case have nearly the same steps (within a few steps)

B.The best case is much better than the worst case

C.The average case is better than the worst case, but not as good as the best case

D.The worst cast has linear run-time based on the # of times evaluated

E.The worst cast has parabolic run-time based on the # of times evaluated