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?
- A$$\Theta \left( {{n^2}} \right)$$
- B$$\Theta \left( n \right)$$
- C$$\Theta \left( {nlogn} \right)$$
- D$$\Theta \left( 1 \right)$$
✓ Correct answer: A
Want the full step-by-step reasoning?