Deployed 644ad0f with MkDocs version: 1.5.3

Author: walkccc

Chap02/2.2/index.html

@@ -9938,7 +9938,7 @@ <h2 id="22-2">2.2-2<a class="headerlink" href="#22-2" title="Permanent link">&pa
 </ul>
 <h2 id="22-3">2.2-3<a class="headerlink" href="#22-3" title="Permanent link">&para;</a></h2>
 <blockquote>
-<p>Consider linear search again (see Exercise 2.1-3). How many elements of the in- put sequence need to be checked on the average, assuming that the element being searched for is equally likely to be any element in the array? How about in the worst case? What are the average-case and worst-case running times of linear search in $\Theta$-notation? Justify your answers.</p>
+<p>Consider linear search again (see Exercise 2.1-3). How many elements of the input sequence need to be checked on the average, assuming that the element being searched for is equally likely to be any element in the array? How about in the worst case? What are the average-case and worst-case running times of linear search in $\Theta$-notation? Justify your answers.</p>
 </blockquote>
 <p>If the element is present in the sequence, half of the elements are likely to be checked before it is found in the average case. In the worst case, all of them will be checked. That is, $n / 2$ checks for the average case and $n$ for the worst case. Both of them are $\Theta(n)$.</p>
 <h2 id="22-4">2.2-4<a class="headerlink" href="#22-4" title="Permanent link">&para;</a></h2>