Consider the Quick sort algorithm in which the partitioning procedure – McqOptions

MCQOPTIONS

1.	Consider the Quick sort algorithm in which the partitioning procedure splits elements into two sub-arrays and each sub-array contains at least one-fourth of the elements. Let T(n) be the number of comparisons required to sort array of n elements. Then T(n)<=?
A.	T(n) <= 2 T(n/4) + cn
B.	T(n) <= T(n/4) + T(3n/4) + cn
C.	T(n) <= 2 T(3n/4) + cn
D.	T(n) <= T(n/3) + T(3n/4) + cn
Answer» C. T(n) <= 2 T(3n/4) + cn

Discussion

No Comment Found

Related MCQs

Quick sort is a space-optimised version of ____
Which one of the following sorting algorithm is best suited to sort an array of 1 million elements?
A machine needs a minimum of 200 sec to sort 1000 elements by Quick sort. The minimum time needed to sort 200 elements will be approximately __________
Consider the Quick sort algorithm which sorts elements in ascending order using the first element as pivot. Then which of the following input sequence will require a maximum number of comparisons when this algorithm is applied on it?
Consider the Quick sort algorithm in which the partitioning procedure splits elements into two sub-arrays and each sub-array contains at least one-fourth of the elements. Let T(n) be the number of comparisons required to sort array of n elements. Then T(n)<=?
Quick sort is a stable sorting algorithm.
The best case behaviour occurs for quick sort is, if partition splits the array of size n into __________
Apply Quick sort on a given sequence 7 11 14 6 9 4 3 12. What is the sequence after first phase, pivot is first element?
What is the worst case time complexity of the Quick sort?
Quick sort is a __________

Related Topics

(MCQs) 1

(MCQs) 2

Recent Visits