Logo Questions Linux Laravel Mysql Ubuntu Git Menu
 

New posts in complexity-theory

If a>=b then O(a+b)=O(a)?

O(log(A)) + O(log(B)) = O(log(A * B))?

big-o complexity-theory

Big-O notation if n is a constant [duplicate]

Simple algorithm analysis

Does multiplication take unit time?

Nested loop with dependent bounds trip count

Proved algorithm to Create Graph With Eulerian Tour?

Big O notation - recursion

Sorting nearly sorted array with O(n*Log(K)) complexity

What is the big O of log(n^2) compared to log(n)?

big-o complexity-theory

Is there an asymptotic limit for x*log(x) in relation to x^a, where a is (1,2)?

What will be Big-O complexity for a recursive function whose number of calculations oscillate with n?

What's the runtime of this algorithm?

find nth prime number

Algorithm to find maximum coverage of non-overlapping sequences. (I.e., the Weighted Interval Scheduling Prob.)

Possible explanation for why lg(n!)=O(nlg(n)) [duplicate]

Running time complexity of the function

What is the complexity of this specialized sort

Open Source Tools to calculate Halstead Complexity metrics for Java file [closed]

Big O (constant) time complexity