Prerequisite : Asymptotic Notations Time Complexity :Time complexity is the time needed by an algorithm expressed as a function of the size of a problem.… Read More

# Tag Archives: time complexity

The word “prune” means to reduce something by removing things that are not necessary. So, Prune-and-Search is an excellent algorithmic paradigm for solving various optimization… Read More

Generally, there is always more than one way to solve a problem in computer science with different algorithms. Therefore, it is highly required to use… Read More

The Recursion Tree Method is a way of solving recurrence relations. In this method, a recurrence relation is converted into recursive trees. Each node represents… Read More

Master’s theorem is a popular method to solve time complexity recurrences of the form: With constraints over a, b and f(n). The recurrence relation form… Read More

In this article, we will discuss the time complexity of the Euclidean Algorithm which is O(log(min(a, b)) and it is achieved. Euclid’s Algorithm: It is… Read More

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

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

Prerequisite: NP-Completeness, Clique problem. A clique in a graph is a set of vertices where each vertex shares an edge with every other vertex. Thus,… Read More

A Min Heap is a Complete Binary Tree in which the children nodes have a higher value (lesser priority) than the parent nodes, i.e., any… Read More

Pre-requisite: Sieve of Eratosthenes What is Sieve of Eratosthenes algorithm? In order to analyze it, let’s take a number n and the task is to… Read More

Question 1: What is the asymptotic boundary of T(n)? θ( n*log(n) ) θ( n2 ) θ( n ) θ( n*log2(n) ) θ( n2*log2(n) ) Answer:… Read More

Recently, BA Continuum India visited our campus for recruitment. There were total 4 rounds. Round 1: This round was a general aptitude test, which consisted… Read More

Cyclomatic complexity of a code section is the quantitative measure of the number of linearly independent paths in it. It is a software metric used… Read More