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 45767
Questions about methods for estimating the increase in runtime of an algorithm as the input size increases.
2
votes
1
answer
58
views
Why %RSD of execution times, while sorting hundreds of arrays, is lower for larger arrays of...
I am experimenting with the sorting of arrays and their execution times.
While using bubblesort, insertsort and quicksort, I have observed that relative standard deviation (%RSD) of execution times, f …
- 67
1
vote
Accepted
Why %RSD of execution times, while sorting hundreds of arrays, is lower for larger arrays of...
In the case of insertsort, the complexity (time) depends on the number of swaps performed during sorting. A kth element (k=1,2,3,...,n) in an array of size n, may require 0 to k swappings.
The execu …
- 67
3
votes
2
answers
116
views
Identifying system events affecting timing behavior of an application
Q: What are those events (system level and architecture level) that can cause an application to take longer to terminate and complete the job?
My question is purely in the context of Worst Case Exec …
- 67