# Algorithm

## Interpolation Search Algorithm – Time Complexity, Implementation in Java

In this article we will have a look at an interesting Searching Algorithm: Interpolation Search. We will also look at some examples and the implementation. Along with this we look at complexity analysis of the algorithm and its advantage over other searching algorithms. Interpolation Search is a modified or rather an improved variant of Binary …

## How to Calculate Running Time of an Algorithm?

In this article, we will learn how to deduce and calculate the Running Time of an Algorithm. Also, we will see how to analyze the Time Complexity of the Algorithm. This is very useful when it comes to analyzing the efficiency of our solution. It provides us with the insight to develop better solutions for …

## Hierholzer’s Algorithm with Implementation in Java

In this article, will look at an interesting algorithm related to Graph Theory: Hierholzer’s Algorithm. We will discuss a problem and solve it using this Algorithm with examples. We will also discuss the approach and analyze the complexities for the solution. Hierholzer’s Algorithm has its use mainly in finding an Euler Path and Eulerian Circuit …

## Boruvka’s Algorithm with Implementation in Java

In this article, we will have a look at another interesting algorithm related to Graph Theory – Boruvka’s Algorithm. We will also look at a problem with respect to this algorithm, discuss our approach and analyze the complexities. Boruvka’s Algorithm is mainly used to find or derive a Minimum Spanning Tree of an Edge-weighted Graph. …

## Tarjan’s Algorithm with Implementation in Java

In this article, we will look at a famous algorithm in Graph Theory, Tarjan Algorithm. We will also look at an interesting problem related to it, discuss the approach and analyze the complexities. Tarjan’s Algorithm is mainly used to find Strongly Connected Components in a directed graph. A directed graph is a graph made up …

## Master’s Theorem Explained with Examples

In this article, we will have a look at the famous Master’s Theorem. This is very useful when it comes to the Design and analysis of Algorithms following Divide and Conquer Technique. We will cover the theorem with its working and look at some examples related to it. Master’s Theorem is Used For? Master’s Method …

## Kadane’s Algorithm (Maximum Sum Subarray Problem) in Java

In this article, we will understand the idea of Kadane’s Algorithm. We discuss this with the help of an example and also discuss a famous interview problem related to it. Then, we will look at the implementation and analyze the complexities of our approach. Kadane’s Algorithm This algorithm is useful in solving the famous ‘Maximum …

## LRU Cache – Design and Implementation in Java

In this article we will learn how to design a LRU Cache, understand it’s cache replacement algorithm. We also look at description of LRU Cache with some examples. Then, we look at the implementation of this design in code with their complexity analysis. Caching is a method of organizing data in a faster memory, usually …