Updated 2 years ago

https://stackoverflow.com/questions/9152890/what-would-cause-an-algorithm-to-have-olog-n-complexity

#53 · opened a year ago by mojtabaaV · 0 comments

Quick edit

#49 · opened 2 years ago by Matthew Lal · 0 comments

Not sure what this is saying: "any problem NP problem can"

#38 · opened 2 years ago by legistrate · 0 comments

I was naively thinking that we were choosing a c1 and c0 to describe a linear polynomial. Since the formal definition is instead simply requiring some slope and then a x >= n0 domain, this could be illustrated by shading the graph above to the right of n==1 and then duplicating the graph with a new slope for 8n+3 and choosing n==2 as the n0.

#7 · opened 2 years ago by legistrate · 0 comments