In quick sort we partition array in two parts across piv

In nimble species we enclosure vest in couple space across pivot component and species them. It is a disunite and prevail-over algorithm.

T(n) = T(k) + T(n-k-1) + theta(n)

Where k is the component which is smaller then pivot component and n-k-1 component is elder then pivot.

In best condition K = n/2

T(n) = T(n/2) + T(n/2) + theta(n)

= 2T(n/2) + theta(n)

by cooperate condition of overcome theorm algorithm

No it referable attributable attributable attributable going to substitute As from recursive tree we can meet the in best condition apex of tree is log n barely.

So period complication is referable attributable attributable attributable going to substitute.