Questions tagged [recurrence]
A recurrence relation is an equation that recursively defines a sequence, once one or more initial terms are given: each further term of the sequence is defined as a function of the preceding terms.
recurrence
1,044
questions
-1
votes
1
answer
140
views
Recurrence formula for Divide and Conquer algorithms - wrong?
I'm currently studying recurrences for divide and conquer algorithms (CLRS chapter 4) and I am struggling to understand a slight change that was made to the latest (4th) edition of the book.
The ...
- 1
0
votes
0
answers
11
views
Understanding TensorFlow GradientTape when there is recurrence
Following on from my previous question, I want to investigate what GradientTape does when a watched variable is used more than once in the calculation, in particular when a neuron has an input that ...
0
votes
0
answers
23
views
How to derive summation for given recurrence relation
I'm working on the following recurrence relation using the iteration technique:
𝑇(𝑛) = 𝑇(𝑛 − 1) + 𝑐𝑛
Here is my process using the technique and deriving a general solution:
my work with solution ...
0
votes
0
answers
20
views
I am struggling to get simple recurrence of events in fullcalendar
I am struggling to get simple recurrence working in fullcalendar. My event JSON is like this:
{"id": 1, "title": "booked", "startTime": "10:00", &...
- 1
0
votes
1
answer
59
views
How to choose base case for substitution method for solving recurrences?
I tried to find out how to solve recurrences using substitution method, but I don't understand: how is the base case chosen when the base case is not given explicitly?
I have two problems:
T(n) = 2T(...
- 1
-1
votes
2
answers
59
views
Algorithm that calculates 2^n in O(lgn)
I need an algorithm that calculates 2^n which is O(lgn) . I did something like this:
algorithm func (n){
if ( n == 0 ) return 1;
else if ( n % 2 == 0) return 2 * func (n/2);
else ...
0
votes
1
answer
229
views
Maximum-value partition using Dynamic programming
Suppose we are given an array A[1..n] of integers (some positive and some negative) which we
are asked to partition into contiguous subarrays called segments. The value of any segment is the
product ...
0
votes
0
answers
36
views
Time complexity of a divide and conquer algorithm that searches for a value in an n x m table, rows and columns are sorted
I am confused about the time complexity of this algorithm because I am thinking it could be something like T(n) = 3T(n/2) ... but since the array has a size of nxm instead of nxn and I am using ...
- 31
0
votes
1
answer
22
views
How to solve the recurrence for Heapify with repeated backward substitution?
So I'm trying to solve the recurrence
So I have:
T(n) <= T(2n/3) + O(1)
We can write:
<= T(2n/3) + O(1)
<= T(4n/9) + 2O(1)
...
<= T((2/3)^i * n) + i*O(1)
So if we solve for i
(2/3)^...
- 1
1
vote
0
answers
64
views
How to send recurrence emails without using Power Automate?
I am using SharePoint Online and I have created one list with name Requests for store the data.
This list contains columns like Title, Description, Start Date, End Date, etc..
I have created an SPFx ...
user20404265
1
vote
1
answer
68
views
Implementing a recursive equation solver in maple
I want to implement a procedure for solving linear recurrence relations similar to rsolve. For my method, I need to substitute functions into the recursive relation and evaluate them at certain points....
- 159
0
votes
0
answers
24
views
Here recurrence relation is given and using back substituion what value i will get?
When n=2^2k for some k >=0, then recurrence relation T(n)=√n T(n/2) + √n, T(1)=1, if we evaluate this what answer will come? Using Back Substition method.
i tried it but i didn't get proper answer. ...
- 1
0
votes
1
answer
421
views
Power Automate Flow | Sending email every first Monday of every month
Fairly new to Power Automate flows, so I need some help in creating a flow that will send an e-mail in Outlook to a certain set of 3 or 4 people every first Monday of every month. The e-mail contents ...
- 11
0
votes
1
answer
60
views
I'm getting a negative part in Time complexity function. Is the solution of the Time complexity of this Recurrence relation correct?
I tried to find the Time complexity of this Recurrence relation [T(n) = 7T(n/2) + n^2] by using Akra Bazzi method .But I am not sure if it's correct or not. Can someone please review the solution and ...
1
vote
1
answer
564
views
Staircase problem - explanation of recursive approach
The problem goes like this:
There are n stairs, a person standing at the bottom wants to climb stairs to reach the nth stair. The person can climb either 1 stair or 2 stairs at a time, the task is to ...
- 5,005