Algorithm Complexity Is Measured Based On Two Components
Algorithm Complexity Is Measured Based On Two Components . Upper bound on growth rate of the function. There are two main complexity measures of the efficiency of an algorithm: A example of the Dijkstra algorithm Download Scientific from www.researchgate.net Complexity of bubble sort the time for assorting algorithm is measured in the number of the comparisons. => n/2^i = 1 => n = 2^i => log2 (n) = log2 (2^i) [applying log2 both sides] => log2 (n) = i * log2 (2) => i = log2 (n) [as logn (n) = 1] so, the worst. For example if we have an order of n 2 operations to process n elements, then n 2 /2 and 3*n 2 are of one and the same quadratic order.