Largest perfect square number in an Array
Given an array of n integers. The task is to find the largest number which is a perfect square. Print -1 if there is no… Read More »
Category Archives: Analysis
Maximum number of parallelograms that can be made using the given length of line segments
Given N line segments where the length of the ith line segment is . The task is to find the maximum number of parallelograms can… Read More »
Probability of getting two consecutive heads after choosing a random coin among two different types of coins
Given two coins which have probability of getting heads p% and q% respectively, the task is to determine the probability of getting two consecutive heads… Read More »
Check whether bitwise OR of N numbers is Even or Odd
Given an array arr[] containing N numbers. The task is to check whether the bitwise-OR of the given N numbers is even or odd. Examples:… Read More »
Jump Pointer Algorithm
The Jump pointer algorithm is a design technique for parallel algorithms that operate on pointer structures, such as arrays or linked list. This algorithm is… Read More »
Count pairs (i,j) such that (i+j) is divisible by A and B both
Given n, m, A and B. The task is to count the number of pairs of integers (x, y) such that 1 x n and… Read More »
Lower and Upper Bound Theory
The Lower and Upper Bound Theory provides a way to find the lowest complexity algorithm to solve a problem. Before understanding the theory, first lets… Read More »
Sort elements by frequency | Set 5 (using Java Map)
Given an integer array, sort the array according to the frequency of elements in decreasing order, if frequency of two elements are same then sort… Read More »
Difference between Deterministic and Non-deterministic Algorithms
In deterministic algorithm, for a given particular input, the computer will always produce the same output going through the same states but in case of… Read More »
Python Code for time Complexity plot of Heap Sort
Prerequisite : HeapSort Heap sort is a comparison based sorting technique based on Binary Heap data structure. It is similar to selection sort where we… Read More »
Applications of Hashing
In this article we will be discussing of applications of hashing. Hashing provides constant time search, insert and delete operations on average. This is why… Read More »
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 »
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 »