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 time-complexity
Search options not deleted
user 35520
The amount of time resources (number of atomic operations or machine steps) required to solve a problem expressed in terms of input size. If your question concerns algorithm analysis, use the [runtime-analysis] tag instead. If your question concerns whether or not a computation will *ever* finish, use the [computability] tag instead. Time-complexity is perhaps the most important sub-topic of complexity theory.
1
vote
Help Understanding the Type and Complexity of my Programming Task
Divide this problem into two parts.
I am attempting to design a program to optimize daily fantasy baseball rosters given certain information. The context here is that I will be designing rosters o …
- 894
1
vote
Can an algorithm that yields $O(n^2)$ answers run in $O(n)$ time?
The upper bound of an algorithm usually has little bearing on it's lower bound. Take for example the following Bubble Sort algorithm:
for(i=0;i<n;i++){
for(j=0;j<n-i;j++){
if(arr[j]>arr[j …
- 894
1
vote
Accepted
Implementing SUM(i,j) and CHANGE(i,j) in O(log(n)) using a datastructure with O(n) space com...
What is a Segment Tree?
It is a data structure which is used to operate over a range of input.
How does it work?
The original elements of the array form the leaves of the tree. Each interna …
- 894