Algorithm Complexity : Recursion Tree

In this post, I aim to explain a method of solving recurrence relations, the result of which will give the complexity of the relation. The performance of the algorithm varies with the input size given to it. Often counting the number of steps performed by algorithm are used to measure its performance. However, for larger … Read More

NP-completeness

Algorithms can be classified on different basis. A few of them have been considered below: Type of operations used by the algorithm Deterministic Algorithms: A deterministic algorithm is an algorithm which, given a particular input, will always produce the same output, with the underlying machine always passing through the same sequence of states. A deterministic … Read More
Follow

Get notified with the latest posts

Plugin Supporter WordPress Post Navigation
%d bloggers like this: