Cases

Questions 1 to 5 of 6

1. 1. A list holds 50 names. Which search input makes linear search do the most comparisons?

   The name stored at position 0A name that is not in the listA name stored at position 25Any name, because every search does the same work
2. 2. Quicksort with the first item as the pivot is given 8 items that are already in sorted order. How many comparisons does it make?

   8162836
3. 3. True or false: if a hash function returns the same number for every key, a lookup costs about as much as a linear search.

   True, because every key lands in one bucket, so a lookup checks the keys in that bucket one at a timeTrue, because the table sorts its keys, so a lookup takes log n checksFalse, because the table still checks one bucket, so the lookup stays constantFalse, because Python switches to a second hash function when a bucket gets long
4. 4. True or false: linear search on a list that does not contain the target is as slow as searching for a target at the last position.

   True, because a missing target stops at the middle of the listFalse, because a missing target is found after the first comparisonTrue, because the loop must read every item before it can return -1False, because the last position is always checked first
5. 5. Quicksort with the first item as the pivot runs on 400 items that are already sorted. How many comparisons does it make?

   Type a number.