A recurrence describes an algorithm's cost using the costs of smaller input sizes plus the work done at the current level.
How to reason about it
Start by identifying the state the method maintains and the operation that changes it. Then trace one small input by hand. This separates the invariant that makes the method correct from implementation details such as arrays, pointers, counters, or protocol messages.
Worked example
Merge sort follows T(n)=2T(n/2)+O(n), because it sorts two halves and merges them in linear work.
Write down the state before and after each step. For a larger input, repeat the same transition rather than guessing from the final output. That habit makes edge cases visible and gives you a concrete basis for testing.
Trade-offs and common mistakes
A recurrence must include both subproblem count and the non-recursive work.'
Choose this technique when its assumptions match the problem. State those assumptions explicitly, test an empty or boundary input, and compare the cost of the operation you perform most often with the memory or setup cost it introduces.
Takeaway
Recurrence Relations for Algorithm Analysis becomes easier to use once its invariant, input assumptions, and failure cases are clear. A small worked example is a useful first test; measurements and proofs should follow when the system grows.