Sorting Algorithms MCQ question and answer with solution | Data Structure MCQs

A. 6

B. 5

C. 7

D. 1

A. it has the same time complexity as standard quick sort

B. it has the same space complexity as standard quick sort

C. it is an in-place sorting algorithm

D. it cannot have a time complexity of O(n²) in any case.

A. gapped insertion sort

B. binary insertion sort

C. recursive insertion sort

D. binary gap sort

A. in order traversal

B. pre order traversal

C. post order traversal

D. breadth first traversal

A. O(n)

B. O(n log n)

C. O(n²)

D. O(log n)

A. counting sort has lesser time complexity when range is comparable to number of input elements

B. counting sort has lesser space complexity

C. counting sort is not a comparison based sorting technique

D. it has no advantage

A. O(n)

B. O(S)

C. O(n²)

D. O(n log n)

A. O(n)

B. O(S)

C. O(n²)

D. O(n log n)

A. (w/logR)

B. N(w/logR)

C. (w/log(RN))

D. (wN/log(N))

A. quick sort with random partitions

B. quick sort with random choice of pivot

C. quick sort with random output

D. quick sort with random input