 Recurrence relations are equations which define one or more sequences recursively.Some specific kinds of recurrence relation can be "solved" to obtain a non-recursive definition (e.g., a closed-form expression).Use of recursion in an algorithm has both advantages and disadvantages.