Average Case Complexity

Read section 10.6, but you can stop after page 456

  1. The “expected number of probes” in linear search is given as p(n+1)/2 + nq. Simplify this function using “big-Oh” notation.  
css.php
The views and opinions expressed on individual web pages are strictly those of their authors and are not official statements of Grinnell College. Copyright Statement.