What is the worst case time complexity of inserting \(n\) elements into an…
GATE · 2020 · CS · Computer Science & IT
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 (n)\) - B.
\(\theta (n \ log \ n)\) - C.
\(\theta (n^2)\) - D.
\(\theta (1)\)
Attempted by 1211 students.
Show answer
Correct answer: C
Explore the full course: Iocl Engineers Officers Grade A Paper 2
Loading lesson…