When will the worst case of Merge Sort occur?...

Advantage of using Dinic's O((V^2)E) algorithm over Edmond-Karp algorithm O(V(E^2))...

Are 2^n and n*2^n in the same time complexity?...

Calculating longest Palindrome substring in the String...

O(N log N) Complexity - Similar to linear?...

Can a program output a copy of itself...

Complexity of Perfectly Balanced Binary Tree...

What is the exact time complexity of this algorithm?...

Intuitive explanation for why QuickSort is n log n?...

How to determine the time complexity of a recursive function that has a loop enclosed in it?...

Is an NP-complete problem also an NP-hard?...

Is a lookup in a hash table O(1)?...

What's the upper bound of f(n) = n^4 + 100n^2 + 50?...

What is O(1) space complexity?...

Why is heap slower than sort for K Closest Points to Origin?...

What is the formal definition of Θ(f(n)) without expressing Θ(f(n)) in terms of O(f(n)) or Ω(f(n))?...

Big O notation of string permutation in Python...

Why log(n!) is O(nlog(n)) and not O(log(n!))...

finding the time complexity of the program...

Why is the knapsack problem pseudo-polynomial?...

How to implement the Sosic and Gu linear algorithm for the n-queens problem...

What is O(log* N)?...

Calculating the Recurrence Relation T(n)=T(n-1)+logn...

Time complexity of a recursive function with three recursive calls...

Time complexity versus space complexity in Turing machines...

Time complexity of unshift() vs. push() in Javascript...

Does overwriting an existing array with a new array cost extra time or memory in the context of comp...

Find the number of steps a string can be reduced to 0...

How to find the set of binary symbols that can most efficiently compress using Huffman coding?...

For a certain problem if I have a O(f1(m,n)) algorithm and a O(f2(m,n)) algorithm, can I have a O(mi...