Sorting without comparison of elements
Given an array with integer elements in small range, sort the array. We need to write a non-comparison based sorting algorithm with following assumptions about… Read More »
Category Archives: Analysis
Measure execution time with high precision in C/C++
Execution time : The execution time or CPU time of a given task is defined as the time spent by the system executing that task… Read More »
In-Place Algorithm
In-place has more than one definitions. One strict definition is. An in-place algorithm is an algorithm that does not need an extra space and produces… Read More »
Cyclomatic Complexity
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 »
Knowing the complexity in competitive programming
Prerequisite: Time Complexity Analysis Generally, while doing competitive programming problems on various sites, the most difficult task faced is writing the code under desired complexity… Read More »
Advanced master theorem for divide and conquer recurrences
Master Theorem is used to determine running time of algorithms (divide and conquer algorithms) in terms of asymptotic notations. Consider a problem that be solved… Read More »
Amortized analysis for increment in counter
Amortized analysis refers to determining the time-averaged running time for a sequence (not an individual) operation. It is different from average case analysis because here,… Read More »
Analysis of Algorithms | Big-O analysis
In our previous articles on Analysis of Algorithms, we had discussed asymptotic notations, their worst and best case performance etc. in brief. In this article,… Read More »
Time Complexity Analysis | Tower Of Hanoi (Recursion)
Tower of Hanoi is a mathematical puzzle where we have three rods and n disks. The objective of the puzzle is to move the entire… Read More »
Time taken by Loop unrolling vs Normal loop
We have discussed loop unrolling. The idea is to increase performance by grouping loop statements so that there are less number of loop control instruction… Read More »
Loop Invariant Condition with Examples of Sorting Algorithms
Loop Invariant Condition: Loop invariant condition is a condition about the relationship between the variables of our program which is definitely true immediately before and… Read More »
Analysis of different sorting techniques
In this article, we will discuss important properties of different sorting techniques including their complexity, stability and memory constraints. Before understanding this article, you should… Read More »
Different types of recurrence relations and their solutions
In this article, we will see how we can solve different types of recurrence relations using different approaches. Before understanding this article, you should have… Read More »
Complexity of different operations in Binary tree, Binary Search Tree and AVL tree
In this article, we will discuss complexity of different operations in binary trees including BST and AVL trees. Before understanding this article, you should have… Read More »
Practice Set for Recurrence Relations
Prerequisite – Analysis of Algorithms | Set 1, Set 2, Set 3, Set 4, Set 5 Que-1. Solve the following recurrence relation? T(n) = 7T(n/2)… Read More »