1,043 questions
- Bountied 0
- Unanswered
- Frequent
- Score
- Trending
- Week
- Month
- Unanswered (my tags)
0
votes
1
answer
52
views
How to find a recurrence relation given a piece of code with 3 inputs
ALGO(A,s,d)
m=d-s+1
if m>=2 then
q=⌊m/2⌋
return 2ALGO(A, s, s+q-1) + 3ALGO(A, s+q, d);
else
return 1
endif
I have this piece of code and I have to find the ...
1
vote
0
answers
71
views
How to find missing byte of 32 bit value of linear recursion in C?
I am working on an improved PKZIP key generation based on PKCRACK.
My aim is to generate key2 candidate that are far less that 4 million given three consecutive plaintext bytes based on this code:
...
-1
votes
1
answer
99
views
In Swift 5, how do I increment a date property by some interval and then run the function with that new future date?
I'm trying to pick a future date based on the current date. I want to use some sort of time interval ie: day, month, year etc.
I wrote code and recurrence function. I get the right number of recurring ...
0
votes
1
answer
69
views
Habit Tracker Recurrence Implementation
I am creating a Habit Tracker app in flutter
and there two screens in App
Home Screen
In this there is a Horizontal list of dates, a tab bar to add different kind of tasks and a floating button that ...
0
votes
0
answers
61
views
Convert local recurrence rule string to UTC recurrence Rule String for recurring events in Javascript
I am developing a calendar app and saving events in utc and handling timezone stuff on front-end. I am facing an issue that when I create a recurring string I select the days according to the local ...
-1
votes
1
answer
246
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 ...
0
votes
1
answer
319
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
votes
2
answers
67
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 ...
user avatar
user16200753
0
votes
1
answer
372
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
59
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 ...
0
votes
1
answer
45
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
vote
0
answers
178
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 ...
user avatar
user20404265
2
votes
1
answer
136
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....
0
votes
0
answers
32
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
vote
1
answer
3k
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 ...