The basic idea behind this method is to guess the answer, and then prove it correct by induction. This method can be used to solve… Read More

# Category Archives: Analysis

Mo’s Algorithm is a generic algorithm. It can be used in many problems that require processing range queries in a static array, i.e., the array… Read More

Time Complexity is a concept in computer science that deals with the quantification of the amount of time taken by a set of code or… Read More

Prerequisite: Analysis of Algorithms | Big-O analysis In the previous article, the analysis of the algorithm using Big O asymptotic notation is discussed. In this… Read More

A Sorting Algorithm is used to rearrange a given array or list elements according to a comparison operator on the elements. The comparison operator is… Read More

Prerequisite: NP-Completeness, Subset Sum Problem Subset Sum Problem: Given N non-negative integers a1…aN and a target sum K, the task is to decide if there… Read More

In this article, we will discuss Time-Space Trade-Off in Algorithms. A tradeoff is a situation where one thing increases and another thing decreases. It is… Read More

Optimized Longest Path Problem: The optimized longest path problem states that given a graph G, of a set of vertices V and edges E, the… Read More

4-SAT Problem: 4-SAT is a generalization of 3-SAT(k-SAT is SAT where each clause has k or fewer literals). Problem Statement: Given a formula f in… Read More

Problem: Given 3 points a, b, c, the task is to check if these three points are collinear. Explanation: An instance of the problem is… Read More

Subset Equality Problem: Given a set S of non-negative integer values, the problem is to identify if there is a partition of the set S… Read More

SAT Problem: SAT(Boolean Satisfiability Problem) is the problem of determining if there exists an interpretation that satisfies a given boolean formula. It asks whether the… Read More

Problem Statement: Given a formula f, the problem is to determine if f has two satisfying assignments. Explanation: An instance of the problem is an… Read More

Prerequisite: NP Complete Problem: Given a ground set X of elements and also a grouping collection C of subsets available in X and an integer… Read More

Problem: Given a ground Set X, an integer k, and a collection of subsets Si of X, the problem is to identify if there exists… Read More