Question Detail

The complexity of merge sort algorithm is

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

Answer: Option D

Similar Questions :

1. Which of the languages is often translated to the pseudo code

PASCAL
FORTRAN
PL/I
BASIC

Answer: Option A

2. minimum number of stacks of size n required to implement a queue of size n

One
Two
Three
Four

Answer: Option B

3. The complexity of merge sort algorithm is

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

Answer: Option D

4. ++i is equivalent to

i = i + 2
i = i + 1
i = i + i
i = i - 1

Answer: Option B

5. Sort which compares adjacent elements in a list and switches where necessary is

Insertion sort
Heap sort
Quick sort
Bubble sort

Answer: Option D

Read more from - Data Structure Questions Answers - Chapter 1