Should we ignore constant k in O(nk)?...

Optimize a perfect number check to O(sqrt(n))...

Big-O notation when the function has negative value...

Time complexity for modified binary search which calculates the mid as high - 2...

Big Oh of creating a BST from a sorted array...

O(1) infinite times...

Recursive formula for recurrence that takes 2 arguments...

Prove O(n) is not a subset of O(n log n)...

Asymptotic comparison of functions...

Order of growth for given functions...

Can I say that a Θ(n^3/2)-time algorithm is asymptotically slower than an Θ(n log n)-time algorithm?...

Meaning of a big O in an exponent...

Algorithm time complexity using recurrence relations...

big o complexity scale function (n+1)^5 / 4n^2...

What functions are included in Big-O Notation?...

Can Lower bound of Upper bound of f(n) equal Upper bound of Lower bound of f(n)...

What is the runtime complexity of this short code?...

Asymptotic complexity of slicing/merging blobs...

Solving this recurrence without the master theorem. Backtracking Algorithm...

How is the time complexity of the following function O(n³)?...

How to solve a recurrence relation such as $T(n) = T(n/2) + T(n/4) + O(m)$...

Calculating the BigO for a code...

Find the bounds as tight as possible?...

Binary Tree array list representation...

Big O Notation of an expression...

Why is the Big-O complexity of this algorithm O(n^2)?...

Check if prime big-o...

How is Asymptotic Complexity Derived for Recursive Functions...

When is an algorithm O(n + m) time?...

Is O(n^3) really more efficient than O(2^n)?...