Reply To:

Given two sorted list of size m and n respectively. The number of comparisons needed the worst case by the merge sort algorithm will be

(A) m x n
(B) maximum of m and n
(C) minimum of m and n
(D) m + n – 1

Home Modern › Forums › ISRO ›

Given two sorted list of size m and n respectively. The number of comparisons needed the worst case by the merge sort algorithm will be

(A) m x n
(B) maximum of m and n
(C) minimum of m and n
(D) m + n – 1

› Reply To:

Given two sorted list of size m and n respectively. The number of comparisons needed the worst case by the merge sort algorithm will be

(A) m x n
(B) maximum of m and n
(C) minimum of m and n
(D) m + n – 1