185 questions
-3
votes
0
answers
22
views
Using python, how do i copying data from one excel to another excel spreadsheet based on user input
This is IO master List where it contains AI,AO,DI,DO i want to copy loop name and loop text and with loop description for example(loop text loop description), IO master list this contain it should ...
2
votes
1
answer
100
views
How to find the time comlexity when comparing sublists?
def check_lists(list_1, list_2):
if list_1 == None:
return None
if list_2 == None:
return None
comparison_result = True
for i in range(len(list_1)):
if ...
- 37
0
votes
1
answer
1k
views
Time Complexity of T(n) = 7T(n/2) + n^2 and T(n) = 7T(n/3) + n^2 [closed]
What is the Time Complexity of T(n) = 7T(n/3) + n^2 and T(n) = 7T(n/2) + n^2 >>>>I applied both akra-bazzi and master theorem but I get different answer....
for T(n) = 7T(n/3) + n^2 using ...
0
votes
0
answers
50
views
Does the multiplication of the recursive calls affect the master's theorem?
I have the following code snippet that I need to calculate its complexity.
int T2 (int n) {
int c = 0;
if (n < 2)
return 1;
else
for (int i = 1; i < n; i = i + 1)
...
- 47
-1
votes
1
answer
136
views
Time complexity of mixedsort (a modification on bubblesort)
So i tried solving this with master theorem but unsure if my solution is correct:
function MixedSort(A[1..n]){
if (n==1) {
return A[1];
}
m = n/2;
B[1 ... m] = bubbleSort(A[1......
- 33
0
votes
1
answer
37
views
Is my application of master theorem correct?
function Sum(A,left,right):
if left > right:
return 0
else if left = right:
return A[left]
mid = floor(N/2)
lsum = Sum(A,left,mid)
rsum = Sum(A,mid+1,right)
return lsum + rsum
function ...
0
votes
1
answer
275
views
Recurrence Relation: Solve T(n) = 25T(n/5) + ((n log 5) / (log n))^2
T(n) = 25T(n/5) + ((n log 5) / (log n))^2
I am new to recurrence relation and was stuck on solving this above question and would like to seek some direction!
I do not think that I am able to apply ...
- 57
0
votes
1
answer
2k
views
What exactly does epsilon represent in master theorem?
I understand substitution method and recursion trees. I understand how to use master theorem but don't understand it's proof or intuitive explanation, specifically i don't understand where does the ...
- 147
0
votes
0
answers
31
views
Determining if case 2 applies of the Master Theorem when a=1, b=2, f(n) = logn
I'm learning the master theorem and have the following problem:
T(n) = T(n/2) + log n
a = 1
b = 2
c = 1
f(n) = log n
Delta = log(1) = 0
So the conditions for master theorem are met.
n^Delta =...
0
votes
0
answers
279
views
Average-case time complexity of QuickSort algorithm
I'm trying to calculate the exact time complexity for QuickSort's average case. A recurrece relation for quicksort is
T(n) = T(p-1)+T(n-p)+n-1
The average case would then be represented by
T(n) = Σnp=...
-2
votes
1
answer
658
views
Solve the recurrences, T(n)=3T(n - 1)+3
Can someone please help me with this recurrences?
T(n)=3T(n - 1)+3
Explanation of steps would be greatly appreciated.
- 3
0
votes
1
answer
239
views
Solving recurrence of divide and conquer using master theorem
Can T(n) = 3T(n/2) + c T(1)=0, solved using master theorem? If yes, I am struggling on understand master theorem now, could someone tell me which case it falls to and why.
- 21
0
votes
2
answers
103
views
what would be the run time of this function using master's theorem
IN-TREE(p, k)
if p == NIL
return FALSE
else if p.key == KEY
return TRUE
else
return IN-TREE(p.left, k) or IN-TREE(p.right, k)
p points to a node in a ...
user14760031
0
votes
0
answers
306
views
Can T(n) = 2T(n/4)+ n^3 + n^2 be solved using Master Theorem?
Can the following recursion:
T(n) = 2T(n/4)+ n^3 + n^2
be solved using Master Theorem?
It meets the preconditions that f(n) is positive, a>=1, b>1, and the difference between (n^3 + n^2) and n/...
- 41
0
votes
1
answer
67
views
Computational complexity and recursion - Is this analysis correct?
Hi! I have a doubt about this resolution of this algorithm analysis, specifically referred to the return min(L[i:j+1]): why is it considered O(n)?: it always refers to a defined slice, with a limited ...
- 59