Algorithms that run our Universe

Orientation of three ordered points

In this article, we will discuss about algorithms to detect the orientation of three given ordered points. Orientation imply collinear, Clockwise or Anti-clockwise.

Algorithms

Simple closed path in a set of points

In this article, we have explored an insightful approach/ algorithm to find a simple closed path in a set of points. This is an important concept in the field of computational geometry.

Algorithms

Meet In Middle Technique

In this post, we discuss the Meet in Middle problem solving technique and show through examples how we can use it to improve a naive brute force algorithm.

Algorithms

Reservoir Sampling Technique

In this article, we have explained the Reservoir Sampling Technique which is the basis of Randomized Algorithms. We have covered two methods Simple Reservoir and Variable Probability.

Algorithms

Klee's algorithm (Union of Line Segments)

In this article, we will dive deep into Klee's algorithm and understand it better. Klee's algorithm is used to find the union of overlapping line segments when projected on a line.

Algorithms

Reverse bits of an Integer

In this article, we have explored an efficient algorithm to Reverse bits of an Integer. The challenge is to do this in-place without using auxiliary memory.

Algorithms

Reverse Integer

In this article, we will explore an efficient algorithm to reverse a 32 bit Integer. This involve edge cases where the reverse integer is out of bounds.

Algorithms

GCD Sort of an Array

In this article, we have explored an insightful approach/ algorithm to sort an array by comparing the Greatest Common Divisor of two of the elements.

Algorithms

Search element in rotated sorted array

In this article, we have explored how to search an element in a Rotated Sorted Array efficiently in O(logN) time with constant space O(1).

Algorithms

Quick Sort on Linked List

In this article, we have explained how to implement Quick Sort on Linked List and if it is as efficient as Quick Sort on Array.

Algorithms

Bubble Sort on Linked List

In this article, we have presented the approach to implement Bubble Sort on Singly Linked List and Doubly Linked List along with implementations in C and C++.

Algorithms

Jump Consistent Hash: A Fast, Minimal Memory, Consistent Hash Algorithm

In this article, we discuss the jump consistent hashing algorithm which offers improvements compared to previous approaches to consistent hashing for distributed data storage applications.

Algorithms

Distributed Hash Table

In this article, we discuss hash tables and their implementations on a larger scale while maintaining its computational complexity that is Distributed Hash Table.

Algorithms

Parallel Merge Sort

In this post, we discuss various approaches used to adapt a sequential merge sort algorithm onto a parallel computing platform. We have presented 4 different approaches of Parallel Merge Sort.

Algorithms

Fruit into Baskets

In this article, we have explained how to solve Fruit into Baskets problem efficiently using the idea of Sliding Window.

Time Complexity

Time and Space Complexity of Kruskal’s algorithm for MST

In this article, we have explored Time and Space Complexity of Kruskal’s algorithm for MST (Minimum Spanning Tree). We have presented the Time Complexity of different implementations of Union Find and presented Time Complexity Analysis of Kruskal’s algorithm using it.

Time Complexity

Time & Space Complexity of Dijkstra's Algorithm

In this article, we have explored the Time & Space Complexity of Dijkstra's Algorithm including 3 different variants like naive implementation, Binary Heap + Priority Queue and Fibonacci Heap + Priority Queue.

Algorithms

Jump Game II: Minimum number of jumps to last index

In this post, we will explore various ways to solve the minimum number of jumps to last index (Jump Game II) problem. In this, we will use ideas of Dynamic Programming and Greedy Algorithm.

Algorithms

Parallel Quick Sort

In this post, we have discussed how to implement Quick Sort algorithm parallelly using 5 different approaches including HyperQuickSort, Parallel quicksort by regular sampling and many more.

Algorithms

4 Array Sum equal to Zero (4Sum II)

In this article, we have explored insightful approaches / algorithms to find elements in 4 arrays whose sum is equal to zero. This is an extension of 4 SUM PROBLEM.

Algorithms

Time & Space Complexity of Merge Sort

In this article, we have explained the different cases like worst case, best case and average case Time Complexity (with Mathematical Analysis) and Space Complexity for Merge Sort. We will compare the results with other sorting algorithms at the end.

Machine Learning (ML)

Best First Search algorithm

Best First Search is a searching algorithm which works on a set of defined rules. It makes use of the concept of priority queues and heuristic search. The objective of this algorithm is to reach the goal state or final state from an initial state by the shortest route possible.

Machine Learning (ML)

A * Search Algorithm

In this article, we are going to have a look at the A * Search Algorithm , its properties, some of its advantages and disadvantages as well as real life applications.

Algorithms

Median of Medians Algorithm

In this post, we explained the median of medians heuristic, its applications and usefulness as well as its limitations. Median of Medians Algorithm is a Divide and Conquer algorithm.

Algorithms

Making A Large Island by changing one 0 to 1

In this article, we have explored an insightful approach/ algorithm to find the largest island by changing one 0 to 1 in MxN matrix. This is an extension of Number of Islands in MxN matrix (of 0 and 1).