Time Complexity Classes: Super-Linear Complexity
Super-Linear Complexity:
- The algorithm takes an amount of time that grows “faster” than the size of the problem. (e.g. when the problem size doubles, the time it takes to solve the problem more than doubles.)
- This class of algorithms is still “practical”. Example complexities that are super-linear (but not exponential) include N*log(N), N*N, N*N*N, etc..