In quick sort we partition array in two parts across piv

In ready class we screen marshal in brace compressiveness abutting pivot atom and class them. It is a disunite and vanquish algorithm.

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

Where k is the atom which is smaller then pivot atom and n-k-1 atom is superior then pivot.

In best event K = n/2

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

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

by relieve event of subdue theorm algorithm

No it referable going to substitute As from recursive tree we can meet the in best event top of tree is log n simply.

So occasion complication is referable going to substitute.