MCQOPTIONS
Saved Bookmarks
| 1. |
Given two sorted list of size 'm' and 'n' respectively. The number of comparison needed in the worst case by the merge sort algorithm will be |
| A. | m × n |
| B. | max (m, n) |
| C. | min (m, n) |
| D. | m + n - 1 |
| Answer» E. | |