I tried to find something similar but wasn't successful, if a question like this exists, my...
Sort using JavaScript sort function is faster or sorting through loop?
Find the length of the longest line with given square (MxM) matrix. (vertical, horizontal, or...
I have been able to find Big-O notation for any problem, but I found a problem with this kind of...
Im currently studying the Log-Structured-Merge tree described by O'Neil et. al. Something is not...
I'm trying to figure out the algorithm to implement a method and I would need some advice in the...
I want to clarify some definitions about Big O notation, because it seems that I absolutely messed...
Let's consider the following function: int foo(int n) { int x = 0; for(int i = 0; i < n;...
T(n) = 27T(n/3) + n^2. I just solved this question and found out the answer is Θ(n^3) by using...
I am a starter in learning recursive function and time-complexity. I have this recursive...
What is the time complexity for the following loop? for(int i=0;i<(n*n);i++) ...
Looks like current memory complexity is O(1) and time complexity is O(k). How to keep the memory...
The interview question was that there is a matrix with integer numbers. Find the length of the...
I'm trying to determine the complexity of converting a collections.deque object into a python list...
I looked up a bit about this but I have found that if I don't know anything about what is in the...
I know that this is apparently a simple question. But I can't get a better approach to get better...
how I can calculate the time complexity of following loss function? omega indicates the set of...
Would the time complexity be the product of the time complexities of each function that is called?...
I have derived the value for the average case for binary search and also for worst case. But i am...
I'm just trying to calculate complexity on some program fragments, but I'm, worried I'm making...
This question already has an answer here: How to find time complexity...
This question already has an answer here: How to find number of...
i'm trying to known time complexity about the following algorithms : static int g(int[] a) { ...
I am having a tough time understanding how time complexity is calculated for a python code. Why is...
I understand intuitively why the time complexity of the naive polynomial evaluation at a point is...
Let's say I have an array of length n and I sorted through it using a sorting algorithm with time...
this is related to the following...
What is the worst and the best time complexity for nested for loop? int compare(int n, int A[][])...
Lecture note Here is my lecture note and i just can't figure out why when j = 2 to n, the times of...
I am trying to find the runtime of this function: myst_fun_1([]) -> 0; myst_fun_1(ListUsed = [_...