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

A. It needs O(1) or O(logn) memory to create auxiliary locations

B. The input is already sorted and in-place

C. It requires additional storage

D. It requires additional space

A. true

B. false

A. True

B. False

A. array in sorted order

B. array sorted in reverse order

C. normal unsorted array

D. large array

A. its processing starts from the most significant digit

B. it is not a stable sort

C. it is an in place sorting algorithm

D. it is non comparison based sort

A.

if(n < 1)
return;

B.

if(n == 0)
return;

C.

if(n == 1)
return;

D.

If(n == 2)
return;

A. 4,2

B. 5,3

C. 5,2

D. 4,3

A. heap sort

B. quick sort

C. merge sort

D. pigeonhole sort

A. one

B. two

C. three

D. four

A. 1,2,3,...,n

B. 1,3,7,....,2k-1

C. 1,3,5,7,....,k-1

D. 1,5,10,15,..., k-1