What will be the recurrence relation of the code of recursive selecti – McqOptions

MCQOPTIONS

1.	What will be the recurrence relation of the code of recursive selection sort?
A.	t(n) = 2t(n/2) + n
B.	t(n) = 2t(n/2) + c
C.	t(n) = t(n-1) + n
D.	t(n) = t(n-1) + c
Answer» D. t(n) = t(n-1) + c

Discussion

No Comment Found

Related MCQs

Under what case of Master’s theorem will the recurrence relation of stooge sort fall?
Matrix A is of order 3*4 and Matrix B is of order 4*5. How many elements will be there in a matrix A*B multiplied recursively.
What is the distance between the lines 3x- 4y+7=0 and 3x-4y+5=0?
Cross product of two vectors can be used to find?
What is the auxiliary space complexity of Z algorithm for pattern searching (m = length of text, n = length of pattern)?
Which of the following operation will give a vector that is perpendicular to both vectors a and b?
What is the result of the recurrences which fall under second case of Master’s theorem (let the recurrence be given by T(n)=aT(n/b)+f(n) and f(n)=nc?
Under what case of Master’s theorem will the recurrence relation of merge sort fall?
What will be the slope of the line given by ax + by + c = 0?
What is the average running time of a quick sort algorithm?