Please enable JavaScript.

Coggle requires JavaScript to display documents.

M4 (Fundamentals of the Analysis of Algorithm Efficiency), Time efficiency…

- - - - it is logical to investigate an algorithm’s efficiency as a function of some parameter n indicating the algorithm’s input size.
        
        The thing to do is to identify the most important operation of the algorithm, called the basic operation, the operation contributing the most to the total running time, and compute the number of times the basic operation is executed.
        
        Thus, the established framework for the analysis of an algorithm’s time efficiency suggests measuring it by counting the number of times the algorithm’s basic operation is executed on inputs of size n.
        
        Here is an important application. Let cop be the execution time of an algorithm’s basic operation on a particular computer, and let C(n) be the number of times this operation needs to be executed for this algorithm. Then we can estimate the running time T (n) of a program implementing this algorithm on that computer by the formula
        
        Worst-Case, Best-Case, and Average-Case Efficiencies
        
        3 more items...