A sorting algorithm which can prove to be a best time algorithm in one – McqOptions

MCQOPTIONS

1.	A sorting algorithm which can prove to be a best time algorithm in one case and a worst time algorithm in worst case is
A.	Quick Sort
B.	Heap Sort
C.	Merge Sort
D.	Insert Sort
Answer» B. Heap Sort

Discussion

No Comment Found

Related MCQs

In an absolute loading scheme, which loader function is accomplished by assembler
What details should never be found in the top level of a top-down design?
A sorting algorithm which can prove to be a best time algorithm in one case and a worst time algorithm in worst case is
Transponders are used for which of the following purposes
If the time quantum is too large, Round Robin scheduling degenerates to
If A speaks the truth 80% of the times, B speaks the truth 60% of the times. What is the probability that they tell the truth at the same time
A person travels 6km towards west, then travels 5km towards north ,then finally travels 6km towards west. Where is he with respect to his starting position?
Complete the sequence A, E ,I ,M ,Q ,U , _ , _
If D is adjacent to F then who is adjacent to C?
If A is beside F then who is are the two neighbours of B?