Algorithm

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 …

Hierholzer’s Algorithm with Implementation in Java Read More »

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. …

Boruvka’s Algorithm with Implementation in Java Read More »

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 …

Kadane’s Algorithm (Maximum Sum Subarray Problem) in Java Read More »

Difference between Lossy and Lossless Compression

Lossy and lossless compression are two kinds of data compression techniques. Here in this article, you will get to learn about what is lossy and lossless compression, their differences, and uses. So, let’s start with the basics. What is Data Compression? Data compression is the process of diminishing the storage size of any data or …

Difference between Lossy and Lossless Compression Read More »