0 votes 0 votes Suppose that the splits at every level of quicksort are in the proportion $(1 – \alpha)$ to $\alpha$, where $0<\alpha\leq\frac{1}{2}$ is a constant. The minimum depth of a leaf in the recursion tree is approximately given by $-\frac{lgn}{lg(1-\alpha)}$ $-\frac{lg(1-\alpha)}{lgn}$ $-\frac{lgn}{lg\alpha}$ $-\frac{lg\alpha}{lgn}$ Algorithms ugcnetjune2014iii data-structures sorting algorithms quick-sort + – makhdoom ghaya asked Jul 12, 2016 recategorized Jul 6, 2022 by Lakshman Bhaiya makhdoom ghaya 2.0k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
2 votes 2 votes if we split with α, we will get minimum depth. suppose α=1/2 means pivot is the middle element. with such case recursion tree will be with minimum depth. other cases it will have maximum. 1. nα^k=1 k=-logn/logα 2. n(1-α)^k=1 k=-logn/log(1-α) wxyz answered Jul 12, 2016 wxyz comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes option c is the correct ans . check out this link https://stackoverflow.com/questions/17684680/maximum-and-minimum-depth-of-quicksort Rusty_01 answered Apr 22, 2022 Rusty_01 comment Share Follow See all 0 reply Please log in or register to add a comment.