A cubic algorithm is one where the number of steps increases as a cube of N, or N³.

An exponential algorithm is one where the number of steps increases as the power of a base, like 2^N.

Both of these categories are astronomical in the number of steps required. Such algorithms are avoided when possible, and for large values of N can run slowly on even the fastest computers.