# Tag Archives: Complexity-analysis

What is Stack? Stack is a linear data structure that follows a particular order in which the elements are inserted and deleted. A stack follows… Read More
Prerequisite: NP-Completeness, NP Class, SAT  Problem– The Almost-SAT problem which is built on top of SAT(Boolean Satisfiability Problem) problem takes a boolean formula in conjunctive… Read More
What is Queue? Queue is a linear data structure that follows FIFO approach (First In First Out). One can imagine a queue as a line… Read More
Prerequisite: NP-Completeness, NP Class, Clique Problem: Given an undirected graph G = (V, E) and an integer K, determine if there is a kite subgraph… Read More
Prerequisite: NP-Completeness, NP Class, SAT  Problem: The MAX-SAT problem which is built on top of SAT(Boolean Satisfiability Problem) problem takes a boolean formula in conjunctive… Read More
What is a logarithm? The power to which a base needs to be raised to reach a given number is called the logarithm of that… Read More
Stack is a linear data structure that follows the LIFO (last in first out) order i.e., the data are entered from one end and while… Read More
Prerequisite: NP-Completeness, NP Class, Sparse Graph, Independent Set Problem: Given graph G = (V, E) and two integers a and b. A set of a… Read More
An array is a linear data structure. In an array, the operation to fetch a value takes constant time i.e., O(1).  Let us see why… Read More
Sorting algorithms are the means to sort a given set of data in an order according to the requirement of the user. They are primarily… Read More
Prerequisite: NP-Completeness, NP Class, Clique, Independent Set Problem: Given an undirected graph G = (V, E) and an integer K, determine if a clique of… Read More
Prerequisites: NP-Completeness, NP Class, Dense Subgraph  Problem: Given graph G = (V, E) and two integers a and b. A set of a number of… Read More
Amortized Analysis is used for algorithms where an occasional operation is very slow, but most of the other operations are faster. In Amortized Analysis, we… Read More
In the previous post, we discussed the analysis of loops. Many algorithms are recursive. When we analyze them, we get a recurrence relation for time complexity.… Read More
We have discussed Asymptotic Analysis,  Worst, Average and Best Cases and Asymptotic Notations in previous posts. In this post, an analysis of iterative programs with… Read More