download Mastguru Android App

Question Detail

The complexity of merge sort algorithm is

  • O(n)
  • O(log n)
  • O(n2)
  • O(n log n)
Similar Questions :

1. Preorder is

  • depth first order
  • breadth first order
  • topological order
  • linear order

2. Which of the following name does not relate to stacks

  • FIFO lists
  • LIFO list
  • Piles
  • Push-down lists

3. In C how many parameters can passed to a function

  • 2
  • 5
  • 10
  • as many as defined in function definition

4. The complexity of Binary search algorithm is

  • O(n)
  • O(log n)
  • O(n2)
  • O(n log n)

5. Which sorting method is slowest

  • Quick sort
  • Heap sort
  • Shell sort
  • Bubble sort
Read more from - Data Structure Questions Answers - Chapter 1
Post a comment