Regarding complexity of an algorithm with steps C(n+r-1, r-1)
===

If an algorithm requires
C(n+r-1, r-1) steps 
to solve a problem, where n is the number of input,
and r is a constant,
does the steps of algorithm consider exponential growth？
