Davinder Singh - 4 years ago in Data Structure

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] mn
[B] max(m,n)
[C] min(m,n)
[D] m+n-1
Loading...

Answers

Guest

Related Questions

Davinder Singh - 4 years ago in Data Structure
Sparse matrices have ?
  • [A] no zero
  • [B] many zero
  • [C] higher dimenstion
  • [D] none
Submit Answer
Davinder Singh - 4 years ago in Data Structure
Which of the following is useful in implementing quick sort?
  • [A] Stack
  • [B] Set
  • [C] List
  • [D] Queue
Submit Answer
Davinder Singh - 4 years ago in Data Structure
A vertex of degree one is called
  • [A] padent
  • [B] isolated vertex
  • [C] null vertex
  • [D] colored vertex
Submit Answer
Davinder Singh - 4 years ago in Data Structure
Linked list are not suitable data structure of which one of the following problems ?
  • [A] Insertion sort
  • [B] Binary search
  • [C] Radix sort
  • [D] Polynomial manipulation
Submit Answer
Davinder Singh - 4 years ago in Data Structure
The number of swapping needed to sort numbers 8,22,7,9,31,19,5,13 in ascending order using bubble sort is ?
  • [A] 11
  • [B] 12
  • [C] 13
  • [D] 14
Submit Answer