MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
| 1. |
In the worst case, the number of comparisons needed to search a singly linked list of length n for a given element is? |
| A. | log 2 n |
| B. | <sup>n</sup> <sub>2</sub> |
| C. | log 2 n 1 |
| D. | n |
| Answer» E. | |