What is the worst case time complexity of inserting n elements into an empty linked list, if the linked list needs to be maintained in sorted order?

What is the worst case time complexity of inserting n elements into an empty linked list, if the linked list needs to be maintained in sorted order?

  1. a) Θ(n)
  2. b) Θ(n log n)
  3. c) Θ(n²)
  4. d) Θ(1)

From the BB Assistant Director (ICT) February 2025 – Written (DU) exam, question 18 of 55.

More from this paper