Complexity Of Algorithms

Complexity Of Algorithms:

There are two case for describing in the complexity of algorithms:

(1) Worst Case: The Maximum value of f(n) for any possible input.
(2) Average Case: The expected value of f(n)

Sometimes we also consider the minimum possible value of f(n), called the best case.

Suppose, The numbers of n₁, n₂, ......, n_k occur with respective probabilities p₁,p₂, ........., p_{k. Then the expectation of average value E is given by}

E = n₁ p₁ + n₂ p₂ + ................... + n_k p_k

If You want to learn about the technology, computer science & engineering, web programming, freelancing, earning please click here :CSE SOLVE