The soul of analysis of algorithms is to determine their complexity. Knowledge of complexity helps in deciding the implementation and choice of algorithms to solve computation problems efficiently.
The complexity of an algorithm A is the function f(n) or T(n) which gives the running time and/or storage space requirement of the algorithms in terms of the size n of the input data. Frequently the storage space required by an algorithm is simply a multiple of the data size n. Accordingly, the term complexity shall refer to the running time of the algorithm only, i.e by a function like T (n).
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment