Given two algorithms with growth rate functions f$($N$)=1000$N$^2$ and g$($N$)=$ N$^2+$ N$,$ the algorithm with growth rate f$($N$)$ grows faster than the algorithm with growth rate g$($N$)$ when the input size N increases.