Question Detail

Which sorting method is slowest

Quick sort
Heap sort
Shell sort
Bubble sort

Answer: Option D

Similar Questions :

1. ++i is equivalent to

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

Answer: Option B

2. The complexity of Bubble sort algorithm is

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

Answer: Option C

3. Merge sort uses

Divide and conquer strategy
Backtracking approach
Heuristic search
Greedy approach

Answer: Option A

4. Which statement we should ignore in structure programming

WHILE-DO
GO-TO
IT-ELSE
SWITCH

Answer: Option B

5. The complexity of merge sort algorithm is

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

Answer: Option D

Read more from - Data Structure Questions Answers - Chapter 1