home
I have a webservice from which I gets a time and price. I have saved those records in a...
This is my program: for(m!=n){ if(m>n) m=m-n; else n=n-m; } If I take...
In the process of using Eventbrite's API to power a website with their events, however, I am stuck...
just wondering, what's the big o of this function, let say the initial value of the parameters is...
I know time complexity for nested loop of n is O(n^2). But If I have the nested loop of as...
You are given an n x n chessboard with k knights (of the same color) on it. Someone has spilled...
From what i understand, O(n) will grow linearly in regards to the size of the input data set. I'm...
So I have to figure out if n^(1/2) is Big Omega of log(n)^3. I am pretty sure that it is not, since...
This question already has an answer here: Javascript ES6...
I think is O(n*log(n)) but I am not sure. I tried log(n*n!) = log(n(n *n-1*n-2* ...* 1)) =...
I have to sort a table (vector), the size of this table is n, and in this table there is distinct...
I need to prove t(n) is O(n!) if t(n) = (n!)(n-1) this is the formula I'm working with? any...
5 days ago

Undefined big omega

I have n^3/100 -100n^2 -100n +3 and I need to find big theta. Is it possible to have an...
I have this relationship (n^2 + 7n - 10) ^3 = O(n^6) I need to prove it is true. I know it is true...
I am struggling to find the correct epsilon for T(n) =9T(n/3)+nlogn. For this T(n) the 1st case of...
for(a = c; a > 0; a/=2) for(b=0; b < 2*a; b++) I have reached the conclusion that this...
for (int i = 1; i <= N; i++) { for (int j = 1; j <= Math.pow(N,1.5); j++) { i = i*2; j =...
What is the runtime for this recursive flatten function? My guess is that it's linear; can someone...
This is a java exercise book problem. I have looked for a method to solve with no success. Let...
1 int sum=0; 2 long start = System.currentTimeMillis(); 3 for (int i = 1; i <= N; i++) { 4 for...
How do I find this function the growth rate based on the big O notation? for(i=1; i*i<n;...
Question 1 public void guessWhat1(int N){ for (int i=N; i>0, i=i/2){ for (int j=0;...
I have a query, what will be the trained LSTM model time complexity in terms of Big O notation? If...
My textbook describes the relationship as follows: There is a very nice mathematical intuition...
I saw these two examples online and I am trying to figure out the runtime for each. I have a guess...
Let's say we have the following complexity: T(n, k) = n^2 + n + k^2 + 15*k + 123 Where we do not...
I have tried to find the big oh for this code, for(int i=0;i<n;i*=2) fun(n); where fun() is a...
In CTCI(Python version), the runtime of the code below is described to be O(N) # O(N) def...
For the following code: for(int i = 0; i < Math.pow(n, 3); i++){ ...some code...
This is a solution to the following problem Basically, you have a string of '-' and '+'...