StackOverflow Questions for Tag: big-o

user111793

Reputation:

Summing an Array and Big O Notation

algorithmsumbig-o

Score: 5

Answers: 5

JTruant

Reputation: 417

Runtime Complexity of a For Loop (n vs. n-1)

for-loopbig-o

Score: 0

Answers: 1

skydoor

Reputation: 25898

Search an element in a heap

algorithmdata-structuresheapbig-o

Score: 43

Answers: 9

Pecan_

Reputation: 27

Computing Big-O for multiple recursive calls where one is logn and the other is linear

time-complexitybig-o

Score: 1

Answers: 0

user5368329

Reputation:

Finding the maximum number in a list python 3

pythonpython-3.xlisttime-complexitybig-o

Score: -1

Answers: 5

Sir Absolute 0

Reputation: 43

Why is this function time complexity O(n*2^n)?

pythonbig-o

Score: 1

Answers: 0

Nicholas Corin

Reputation: 2404

Big O Notation for Algorithm

c++algorithmbig-otime-complexityanalysis

Score: 4

Answers: 6

Dog

Reputation: 2916

What is the purpose of a LinkedList in Java Considering an ArrayList Has No Size Limit?

javaarraysalgorithmlinked-listbig-o

Score: -1

Answers: 4

Russell Ng

Reputation: 173

4SUM variation in quadratic complexity (Python 3.5)

pythonalgorithmhashtablebig-o

Score: 1

Answers: 1

Meena Chaudhary

Reputation: 10695

Understanding Time complexity calculation for Dijkstra Algorithm

algorithmgraphbig-otime-complexitydijkstra

Score: 136

Answers: 8

Jeffrey Lott

Reputation: 7439

Difference between Big-O and Little-O Notation

algorithmtime-complexitybig-oasymptotic-complexitylittle-o

Score: 455

Answers: 5

Arec Barrwin

Reputation: 62051

What is a plain English explanation of "Big O" notation?

algorithmcomplexity-theorycomputer-sciencebig-otime-complexity

Score: 5393

Answers: 43

Ritveak

Reputation: 3788

Why is O(n) better than O( nlog(n) )?

algorithmdata-structurestime-complexitybig-o

Score: 95

Answers: 12

Ythene

Reputation: 23

Deriving O(N*log(N)) for Comparison Sort, question on one particular step in wikipedia's derivation

sortingtime-complexitybig-o

Score: 2

Answers: 2

pepper

Reputation: 11

How to find a recurrence relation given a piece of code with 3 inputs

algorithmbig-orecurrence

Score: 0

Answers: 1

sheldonzy

Reputation: 5971

time complexity exercise (pseudo code)

time-complexitybig-o

Score: 1

Answers: 2

user3456374

Reputation: 51

The time complexity of nested loops with a constant

algorithmbig-o

Score: 1

Answers: 3

Sri T

Reputation: 59

How is it possible that O(1) constant time code is slower than O(n) linear time code?

time-complexitybig-o

Score: 5

Answers: 2

templatetypedef

Reputation: 373082

What would cause an algorithm to have O(log log n) complexity?

algorithmbig-otime-complexitycomplexity-theorylogarithm

Score: 124

Answers: 3

Takkun

Reputation: 6361

O(log n) algorithm for finding max of array?

algorithmbig-o

Score: 19

Answers: 12

PreviousPage 1Next

StackOverflow Questions for Tag: big-o

Summing an Array and Big O Notation

Runtime Complexity of a For Loop (n vs. n-1)

Search an element in a heap

Computing Big-O for multiple recursive calls where one is logn and the other is linear

Finding the maximum number in a list python 3

Why is this function time complexity O(n*2^n)?

Big O Notation for Algorithm

What is the purpose of a LinkedList in Java Considering an ArrayList Has No Size Limit?

4SUM variation in quadratic complexity (Python 3.5)

Understanding Time complexity calculation for Dijkstra Algorithm

Difference between Big-O and Little-O Notation

What is a plain English explanation of &quot;Big O&quot; notation?

Why is O(n) better than O( nlog(n) )?

Deriving O(N*log(N)) for Comparison Sort, question on one particular step in wikipedia&#39;s derivation

How to find a recurrence relation given a piece of code with 3 inputs

time complexity exercise (pseudo code)

The time complexity of nested loops with a constant

How is it possible that O(1) constant time code is slower than O(n) linear time code?

What would cause an algorithm to have O(log log n) complexity?

O(log n) algorithm for finding max of array?

What is a plain English explanation of "Big O" notation?

Deriving O(N*log(N)) for Comparison Sort, question on one particular step in wikipedia's derivation