in DS
182 views
1 vote
1 vote

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. $\Theta(n)$
  2. $\Theta(n \log n)$
  3. $\Theta ( n)^{2}$
  4. $\Theta(1)$
in DS
by
589 points
182 views

1 Answer

0 votes
0 votes
by
173 points
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.