________ method is often used to prove lower bounds in sorting.

________ method is often used to prove lower bounds in sorting.

  1. a) Recursion tree
  2. b) Master theorem
  3. c) Decision tree
  4. d) Dynamic programming

From the BCS Technical Cadre (ICT) October 2025 – 49th BCS Written (Special) (BPSC) exam, question 36 of 106.

More from this paper