Technology, Algorithms.
that polynomials always grow more slowly than exponentials from our list above so if we plug in some actual numbers we will notice for larger numbers c^n actually takes more time to run than n^k so we can say n^k = O(c^n). You can visit this link to learn more about how to compare functions