Skip to main content
Filter by
Sorted by
Tagged with
0 votes
1 answer
37 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 ...
pepper's user avatar
  • 11
1 vote
0 answers
68 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: ...
terry franklin's user avatar
-1 votes
1 answer
85 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 ...
Roman Potapov's user avatar
0 votes
1 answer
55 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 ...
Ahsan Mobarki's user avatar
0 votes
0 answers
52 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 ...
Muhammad Junaid's user avatar
-1 votes
1 answer
227 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 ...
oc_rlee's user avatar
0 votes
0 answers
15 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 ...
Richard Whitehead's user avatar
0 votes
0 answers
28 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 ...
spookikitti's user avatar
0 votes
1 answer
265 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(...
poilouyh's user avatar
-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
0 votes
1 answer
324 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 ...
albusaidi's user avatar
0 votes
0 answers
41 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 ...
Leah M's user avatar
  • 21
0 votes
1 answer
36 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)^...
Yuirike's user avatar
  • 41
1 vote
0 answers
135 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
2 votes
1 answer
118 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....
Martin Clever's user avatar

15 30 50 per page
1
2 3 4 5
70