Consider again the modification of the deterministic version ofthe quick-sort algorithm so that, instead of selecting the lastelement in an n-element sequence as the pivot, we choose theelement at index n/2. Describe the kind of sequence that wouldcause this version of quick-sort to run in Θ(n2) time.
Solution
the Divot was chosen en the middle for a duicksort aloorithm , the sunning ime of choosing -he pivot would stfil be OCI) THe onlH.time
OR
OR