Stack Overflow.I see some great resources on time complexity here, but so far I haven\'t been able to answer to this space complexity question using them.So:
What is the complexity with respect to the string length that takes to perform a regular expression comparison开发者_运维技巧 on a string?The answer depends on what exactly you mean by \"regular expre
Hi I have a question that: consider I have T(n) = m * n^2(n<m) is this correct to write T(n) = O(m) ?because I have written T(n) = m*n*n So bec开发者_开发技巧ause n<m we have T(n) = O(m)
int[][] A = new int [n][]; for (int i=0; i<n; i++) { if (i % 2 == 0) // i is a multiple of 2 A[i] = new int [n];
I implemented a program for powering a number (a^n) using the divide and conquer technique. i implemented two versions of the same problem:
If f(n) = 15n^3 + 7n^2 + 34 & g(n) = n^4 + 3n^2 + 17. How do I prove f belongs to O(开发者_JAVA技巧g)? Well the definition of Big-O notation is as follows:
Big oh notation says that all g(n) are an element c.f(n), O(g(n)) for some constant c. I have always wondered and never really understood why we need this arbitrary constant to multip开发者_高级运维l
开发者_如何学运维 It's difficult to tell what is being asked here. This question is ambiguous, vague, incomplete, overly broad, or rhetorical andcannot be reasonably answered in its current for
I have spent a lot of time reading questions and answers about Big-Oh on both here and math.stackexchange and seems that this is the best place for it as math.stackexchange don\'t seem to like questio
Lets say we have a problem we implemented using X algorithm with O(n) or O(log n) or etc.... When is the value of n big enough that we must consider an alternative implementation? Let\'s see if i can
加载中,请稍侯......