Tag: big-o

Found 84 results for 'big-o'.

1) algorithm - What does O(log n) mean exactly?
2) algorithms - why adding a vertex in a graph represented using an adjacency matrix takes O(|v|^2) time complexity?
3) c++ - What are the complexity guarantees of the standard containers?
4) python - condition priority in if-else for efficiency
5) algorithms - What is a O(n) algorithm to solve this puzzle?
6) algorithm - Understanding Time complexity calculation for Dijkstra Algorithm
7) c++ - Is list::size() really O(n)?
8) algorithms - Best Upper Bound & Best Lower Bound of an Algorithm
9) algorithms - Big-O for nested loop
10) complexity - Time Complexity when Loop Variable Depends upon Outer Loop Variable
11) algorithm - Dijkstra in 2-D array Time complexity
12) algorithms - Is the time complexity of a while loop with three pointers different than 3 nested for loops?
13) algorithms - Efficient way to calculate how many items to destroy if each has a 70% chance to be destroyed
14) big-o - What is the difference between Θ(n) and O(n)?
15) algorithms - Big O notation of randomness
16) big-o - Notation for the average time complexity of an algorithm
17) recursion - How do I determine the runtime of a double recursive function?
18) algorithm - Big O, how do you calculate/approximate it?
19) complexity - How to calculate big O notation according to number width?
20) algorithms - Algorithm to merge two sorted arrays with minimum number of comparisons
21) python - How come list element lookup is O(1) in Python?
22) data-structures - Why is the complexity of fetching a value from an array be O(1)?
23) c++ - Performance of breaking apart one loop into two loops
24) algorithms - Running time of simple for-loops
25) algorithms - Big O Question about an algorithm with (n^2 + n) / 2 growth rate
26) algorithms - randomly filling in empty spaces in a matrix - O(N) amortized time?
27) trees - Big-O for Immutable Trees
28) algorithms - single for-loop runtime explanation problem
29) python - Is the complexity of this code quasilinear time?
30) algorithm - When should we use soft-O, soft-Omega, soft-Theta
31) algorithms - What does 'upper bound' mean in context of BigO?
32) algorithms - Finding longest subsequence with sum less than or equal to a fixed number
33) complexity - Problems Calculating Big-O Complexity
34) big-o - BIG O - Algorithm Case Analysis
35) algorithms - When speaking, how can I say that the time complexity order of an algorithm is O(N log N)?
36) python - How come list element lookup is O(1) in Python?
37) algorithm - Are there any cases where you would prefer a higher big-O time complexity algorithm over the lower one?
38) c++ - Change of the complexity class through compiler optimization?
39) python - Why is the worst case for this function O(n^2)?
40) algorithm - Big O, how do you calculate/approximate it?
41) java - problem on calculating Big O complexity
42) complexity - What is meant with finding real and integer constants in Big Oh notation?
43) big-o - What is the difference between lower bound and tight bound?
44) algorithms - Running time for simple for loops - Big O notation
45) algorithm-analysis - Space complexity of Iterative Deepening DFS
46) algorithms - Please explain the statement that the function an+b belongs to O(n^2) and Θ(n)?
47) algorithms - Is my reasoning to determine this algorithm's Big-O correct?
48) complexity - What is the time complexity of this program?
49) algorithms - Please explain the statement that the function an+b belongs to O(n^2) and Θ(n)?
50) algorithms - Can "sub-linear" still be a straight line?