Classical

Data Structures - Sorting & Searching

41:  

Which of the following algorithms exhibits the unnatural behavior that, minimum number of comparisons are needed if the list to be sorted is in the reverse sorted order and maximum number of comparisons are needed if they are already in sorted order?

A.

heap sort

B.

Radix sort

C.

Binary insertion sort

D.

There can't be any such sorting method

 
 

Option: C

Explanation :


42:  

Which of the following sorting algorithm has the worst time complexity of nlog(n)?

A.

Heap sort

B.

Quick sort

C.

Insertio nsort

D.

Selection sort

 
 

Option: A

Explanation :


43:  

Which of the following sorting methods sorts a given set of items that is already in sorted order or in reverse sorted order with equal speed?

A.

Heap sort

B.

Quick sort

C.

Insertion sort

D.

Selection sort

 
 

Option: B

Explanation :




Suggest an improvement