StackOverflow Questions for Tag: complexity-theory

Suugaku

Reputation: 2747

Programming languages complexity

programming-languagescomplexity-theory

Score: 6

Answers: 12

Felix Doe

Reputation: 299

Time Complexity

algorithmtimecomplexity-theory

Score: 0

Answers: 4

Max Haslbeck

Reputation: 191

Why does C++11 require std::sort to have WCET O(n log n)?

c++algorithmsortingc++11complexity-theory

Score: 14

Answers: 2

user8934825

Reputation: 19

What is the computational complexity of generating a stream from a HashSet of a given size and capacity?

javajava-streamcomplexity-theoryhashset

Score: 1

Answers: 1

Jeffrey Lott

Reputation: 7439

Difference between Big-O and Little-O Notation

algorithmtime-complexitybig-oasymptotic-complexitylittle-o

Score: 455

Answers: 5

Dirk

Reputation: 6884

What's the fastest algorithm for sorting a linked list?

algorithmsortinglinked-listcomplexity-theory

Score: 115

Answers: 15

user2377778

Reputation: 73

Step Count in Algorithm

algorithmcomplexity-theory

Score: 2

Answers: 3

Mutmut

Reputation: 13

Can we get a better complexity than O(n) for cumulative sum while using multithreading?

multithreadingalgorithmtime-complexitycomplexity-theory

Score: 1

Answers: 2

Stephen Ware

Reputation: 111

How to write a unit test to determine if an operation takes about linear time?

unit-testingcomplexity-theory

Score: 0

Answers: 2

martinkunev

Reputation: 1405

Why is the time complexity of Dijkstra O((V + E) logV)

complexity-theorydijkstra

Score: 1

Answers: 2

David

Reputation: 1463

Worst scenario for shell sort: Θ(N^3/2) or O((NlogN)^2)?

sortingtime-complexityasymptotic-complexity

Score: 4

Answers: 2

Arec Barrwin

Reputation: 62051

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

algorithmcomplexity-theorycomputer-sciencebig-otime-complexity

Score: 5393

Answers: 43

Ravid Ofek

Reputation: 49

Smooth GPS tracking with google maps

javaandroidgoogle-mapscomplexity-theoryandroid-gps

Score: 0

Answers: 1

yes

Reputation: 9

Can someone evaluate the time complexity of this function

algorithmtimecomplexity-theory

Score: 1

Answers: 1

templatetypedef

Reputation: 373082

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

algorithmbig-otime-complexitycomplexity-theorylogarithm

Score: 124

Answers: 3

jameshfisher

Reputation: 36559

Haskell GHC: what is the time complexity of a pattern match with N constructors?

haskellpattern-matchingcomplexity-theoryghc

Score: 36

Answers: 1

Stephen Emslie

Reputation: 11015

Time complexity of python set operations?

pythondata-structuressetcomplexity-theorybig-o

Score: 172

Answers: 4

user3700810

Reputation: 1

Solving 2sat #P algorithm results into P=NP

complexity-theory

Score: -1

Answers: 2

Riccardo Piana

Reputation: 107

Isn't every algorithm technically ω(0)?

time-complexitycomplexity-theory

Score: 0

Answers: 1

yyy

Reputation: 912

Time complexity of nested for-loop

big-ocomplexity-theorytime-complexity

Score: 66

Answers: 11

PreviousPage 1Next

StackOverflow Questions for Tag: complexity-theory

Programming languages complexity

Time Complexity

Why does C++11 require std::sort to have WCET O(n log n)?

What is the computational complexity of generating a stream from a HashSet of a given size and capacity?

Difference between Big-O and Little-O Notation

What&#39;s the fastest algorithm for sorting a linked list?

Step Count in Algorithm

Can we get a better complexity than O(n) for cumulative sum while using multithreading?

How to write a unit test to determine if an operation takes about linear time?

Why is the time complexity of Dijkstra O((V + E) logV)

Worst scenario for shell sort: Θ(N^3/2) or O((NlogN)^2)?

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

Smooth GPS tracking with google maps

Can someone evaluate the time complexity of this function

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

Haskell GHC: what is the time complexity of a pattern match with N constructors?

Time complexity of python set operations?

Solving 2sat #P algorithm results into P=NP

Isn&#39;t every algorithm technically ω(0)?

Time complexity of nested for-loop

What's the fastest algorithm for sorting a linked list?

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

Isn't every algorithm technically ω(0)?