In the worst case, the number of comparisons in the Insertion sort algorithm is:

In the worst case, the number of comparisons in the Insertion sort algorithm is:

  1. a) n(n+1)
  2. b) n logₑ n
  3. c) n(n-1)/2
  4. d) n(n-1)/4

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

More from this paper