MCQOPTIONS
Saved Bookmarks
| 1. |
Minimun number of comparison required to compute the largest and second largest element in array is |
| A. | n-[log₂n]-2 |
| B. | n+[log₂n-2] |
| C. | log₂n |
| D. | None of these |
| Answer» C. log₂n | |