What is the information$-$theoretic lower bound for finding the maximum of $n$ numbers by comparison$-$based

algorithms?

${|}_{{?}_{?}}lo{g}_2{n}_{{?}_{?}}|$

$|$~$lo{g}_2$~$|$

n$-1$

n