Recursive Algorithm It can be solved in terms of itself Recurrence relation defines sequenced based on rule those next terms as a function of previous terms. Next term is function of pervious terms. Defined by itself (in term of previous terms) Can model the cpmplexity of divide and conquer algorithm Solving Recurrence Relations To define...
