Briefly describe the notations of (a) the complexity of an algorithm and (b) the space-time tradeoff of algorithms :
(a) The complexity of an algorithm is a function f(n) which measures the time and/or space used by an algorithm in terms of the input size n.
(b) 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.
If You want to learn about the technology, computer science & engineering, web programming, freelancing, earning please click here :CSE SOLVE
(a) The complexity of an algorithm is a function f(n) which measures the time and/or space used by an algorithm in terms of the input size n.
(b) 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.
Posts
0 comments:
Post a Comment