Thanks for pointing out. For calculating a factorial time complexity will be O(n). We calculate the time complexity of a recursion algorithm using the recurrence relation.