I always face difficulty in finding the time complexity of Backtracking / Recursive function. Can somebody please clarify when it is exponential and when it is factorial. How adding a loop inside the recursion changes TC ? How having multiple recursive calls changes TC ?
Thanks in advance.