The two parts of a recursive algorithm is the stopping condition and recursive call.

The time complexity of a recursive function is $O(2^n)$.