Combination Sum, The number of recursive calls is directly proportional to the input size and the target sum, resulting in an O(2^n) time complexity in the worst case, where n is the input size.