Top "Big-o" questions

Calculating phi(k) for 1<k<N

Given a large N, I need to iterate through all phi(k) such that 1 < k < N : time-complexity must …

algorithm math big-o primes

Is this technically an O(1) algorithm for "Hello World"?

Would this be classified as an O(1) algorithm for "Hello, World!" ?? public class Hello1 { public static void Main() { DateTime TwentyYearsLater = …

c# .net algorithm big-o

Prove f(n) + g(n) is O(max(f(n),g(n)))

Hello I am having a bit of difficulty proving the following. f(n) + g(n) is O(max(f(n),…

algorithm big-o analysis notation

How to calculate order (big O) for more complex algorithms (eg quicksort)

I know there are quite a bunch of questions about big O notation, I have already checked: Plain english explanation …

algorithm complexity-theory big-o

Meaning of lg * N in Algorithmic Analysis

I'm currently reading about algorithmic analysis and I read that a certain algorithm (weighted quick union with path compression) is …

algorithm runtime big-o analysis iterated-logarithm

What's the time complexity of array.splice() in Google Chrome?

If I remove one element from an array using splice() like so: arr.splice(i, 1); Will this be O(n) …

javascript google-chrome big-o time-complexity v8

Is the time complexity of the empty algorithm O(0)?

So given the following program: Is the time complexity of this program O(0)? In other words, is 0 O(0)? I thought …

algorithm math theory big-o

Are there any cases where you would prefer a higher big-O time complexity algorithm over the lower one?

Are there are any cases where you would prefer O(log n) time complexity to O(1) time complexity? Or O(…

algorithm big-o time-complexity

What are the rules for the "Ω(n log n) barrier" for sorting algorithms?

I wrote a simple program that sorts in O(n). It is highly memory inefficient, but that's not the point. …

performance algorithm sorting big-o lower-bound

What is the complexity of this simple piece of code?

I'm pasting this text from an ebook I have. It says the complexity if O(n2) and also gives an …

java complexity-theory big-o time-complexity stringbuffer