THE performance evaluation of an algorithm is obtained by totalling the number of occurrences of each operation when running the algorithm. performance of an algorithm depend upon the time and space. time taken by the algorithm depends upon many factors: one of the factor is operation used by the algorithm. run time efficiency of an algorithm depends upon the execution time of instruction in algorithm for a set of inputs. There instruction are used in an algorithm in such a way that execution time of instruction become less for the inputs. To solve this problem scientists developed asymptotic notations. These notations are commonly used in performance on analysis and used to characterize the complexity. There are various nation used in such type of analysis
No comments:
Post a Comment