Computer Science, asked by abhishekjangir3945, 1 year ago

What is recurrence relation for worst case of quicksort?

Answers

Answered by Anonymous

5

Answer:

Assume we construcred a quicksort and the pivot value takes linear time find the recurrence for worst-case running time.

My answer : T(n)=T(n-1)+T(n)+theta(n).

Worst case occur when the subarrays are completely unbalance .There is element in one subarray and n-1 elements in the other subarray.

Theta n because it takes running time n to find the pivot.

Hope it helps you✌✌✌

Previous Question

Next Question

Similar questions

Political Science, 6 months ago

g. What do you meant by individual differences ?

Economy, 6 months ago

sarkar ke do karyo ka ulekh kijiye ...

English, 6 months ago

Question no-1 : Write down a few sentences about how people suffer if there is too much water .

Science, 1 year ago

Describe the particulars of Handball game and the use of equipments in it.

Science, 1 year ago

Describe the unfavourable acts (fouls) in the game of Judo.

Computer Science, 1 year ago

An entity type is which of the following? A.A major category of data about people, place, and things B.The various departments of an organization C.The application software D.The business processes the support the mission of an organization...

Computer Science, 1 year ago

The use of packaged data models can offer which of the following benefits? A.Reduce implementation time and costs B.Higher quality models C.Both A and B. D.Neither A nor B.

Computer Science, 1 year ago

Which of the following database activities determines the entities, attributes, and relationships of data? A.Conceptual data modeling B.Logical database design C.Physical database design and definition D.Database implementation...