Algorithms that run our Universe

Maximum sum leaf to root path

In this article, I will be discussing about Maximum sum leaf to root path in Binary tree along with time and space complexity.

Algorithms

Super Pow Problem [LeetCode: 372]

Your task is to calculate a^b mod 1337 where a is a positive integer and b is an extremely large positive integer given in the form of an array.

Algorithms

Different approaches to calculate Euler's Number (e)

In this article, we have explored different approaches to calculate Euler's Number (e) along with sample implementations to calculate Euler's number to different precision.

Algorithms

Stack vs Linked List

In this article, we will be discussing about "Stack vs Linked List" in detail.

Time Complexity

Time and Space Complexity of Selection Sort on Linked List

In this article, we will learn about the space and time complexity of the Merge sort algorithm on Linked List using Mathematical analysis of various cases.

Randomized Algorithm

Majority Element using randomized algorithm

This article at OpenGenus introduces a randomized algorithm for finding the majority element. On average it has the same runtime, but when the size of the array increases exponentially, this algorithm is much much faster probabilistically.

List of Mathematical Algorithms

Fermat number and Pepin's test

In this article, we have explored the concept of Fermat number, demonstrated C++ implementations to compute and verify fermat number and explained Pepin's test for Fermat number.

Algorithms

Sparse matrix multiplication

In this article, we aim to study sparse matrices and the sparse matrix multiplication.

String Algorithms

String isomorphism

In this article, we will learn about string isomorphism and algorithms to solve this problem efficiently.

Algorithms

Heap vs Binary Tree

Today we are going to compare two non linear data structures binary trees and heaps since both are non liner there tend to be confusion regarding both of these usually we will try to remove these confusion.

Algorithms

Graph and subgraph isomorphism

In this article, we will learn about graph and subgraph isomorphism and the algorithms to check for graph and subgraph isomorphism.

List of Mathematical Algorithms

Lagrange’s Four Squares Theorem

In this article, we will discus Lagrange’s four square theorem in detail with examples and an algorithm to verify it.

List of Mathematical Algorithms

Mersenne prime numbers

When 2^n -1 is prime, it is said to be a Mersenne prime. In this article, we have explored this concept of Mersenne prime numbers in depth along with algorithms + implementations to find Mersenne prime numbers.

Algorithms

Greedy Algorithm vs Dynamic programming

In this article, we will discuss greedy methods vs dynamic programming. Both of them are used for optimization of a given problem. Optimization of a problem is finding the best solution from a set of solutions.

Algorithms

Time and Space Complexity of Prim’s algorithm

In this article, we will learn more about Prim's algorithm and analyze its complexity for different cases and implementation approaches.

Algorithms

Interpolation Search [EXPLAINED]

In this article, we have explained the concept of Interpolation Search and analyzed the performance of interpolation search in terms of time and space complexity.

backtracking

Iterative Backtracking

In this article, we will be exploring the idea of backtracking with the help of iteration (Iterative Backtracking) along with example as well. The Time and Space Complexity will be discussed at the end of the article.

List of Mathematical Algorithms

Andrica's conjecture

Andrica's conjecture states that for every gap between two consecutive square roots of prime numbers, the value of it is less than 1.

Algorithms

Generate all palindromes less than N

In this problem, we will see how to generate palindromic number in a given range efficiently by exploring the patterns of palindromes.

Algorithms

Scramble String problem

We will be given two strings a, and b we have to check whether one string is scrambled version of other string or not.

Algorithms

Biconnected graph

A biconnected graph is a graph that is connected and has no articulation points.

Graph Algorithms

Entropy of Graph

In graph theory, entropy is the index for describing the structure and function of a network. Entropy is related to amount of information stored in a graph. This is used in field of computer science to check compression of data as compressed data is more random and hence has higher entropy.

Algorithms

Geometric Hashing

Geometric hashing is a computer vision technique used to detect geometric features in images and matching them to a database with such features. What makes geometric hashing stand out is that it can detect overlapping objects.

game theory

Game Tree

In this article, we have covered the concept of how Backtracking help us to solve Game Tree. We will solve the Game Tree Problem by making use of the Minimax Algorithm. We have presented the Time and Space Complexity for various cases.

queue

Dynamic Queue

In this article, we will see what a dynamic queue is and how it is implemented. In short, Dynamic Queue is a Queue whose allocated memory may increase or decrease depending on the number of elements being inserted or deleted in Queue.