多选题

知识点：数据结构 4/10（单选/必答） Given two sorted...

Question

知识点：数据结构 4/10（单选/必答）
Given two sorted lists of size m and n respectively. The number of comparisons 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