__Briefly describe the notations of (a) the complexity of an algorithm and (b) the space-time tradeoff of algorithms :__

**The complexity of an algorithm is a function**

__(a)__*f*(n) which measures the time and/or space used by an algorithm in terms of the input size n.

__The space-time tradeoff refers to a choice between algorithmic solutions of a data processing problem that allows one to decrease the running time of an algorithmic solution by increasing the space to store the data and vice versa.__

**(b)**
## 0 comments:

## Post a Comment