Suppose you want to insert n elements into an empty linked list while maintaining the sorted order.What is the worst -case time complecity?

Suppose you want to insert n elements into an empty linked list while maintaining the sorted order.What is the worst -case time complecity?

A θ(n)

B θ(nlogn)

C θ(1)

D θ(n²)

Solution

Correct Answer: Option D