Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with runtime-analysis
Search options not deleted
user 40792
Questions about methods for estimating the increase in runtime of an algorithm as the input size increases.
4
votes
3
answers
26k
views
What is the average time complexity, for a single linked list, for performing an insert?
I thought this would be a very simple O(n) b.c. you can do the insert any where with in the list.
The longer the list, the longer it will take on average to do the insert.
However according to bigoc …
- 141