Time Complexity Classes: Sub-Linear Complexity
Sub-Linear Complexity:
- The algorithm takes an amount of time that grows “slower” than the size of the problem. (e.g. when the problem size doubles, the time it takes to solve the problem doesn’t quite double.)
- This class of algorithms is quite efficient. Example complexities that are sub-linear include sqrt(N) and log(N).