$1.$ Analysis of an algorithm generally finds the amount of work done in the worst case because it is too difficult to analyze an average case.

$2.$ In the worst case, the string pattern$-$matching algorithm requires n$+$m comparisons, where n $=$ the text size and m $=$ the pattern size.

$3.$ Binary search is more efficient than sequential search on a sorted list of more than three elements.