Algorithms

Algorithms

Find Square Root of Number using Binary Search

In this article, we have discussed how to find square root of a number using binary search.

computational geometry

Map Overlay Problem

In this article, we will be exploring the Map Overlay Problem which is a core problem in Computational Geometry. We have explored simple variants of Map Overlay Problem.

Data Structures

Circular Doubly Linked List

In this article, we have explored Circular Doubly Linked List and operations that can be performed on it. It is a combination to two Data Structures namely Circular Linked List and Doubly Linked List.

Dynamic Programming (DP)

Dynamic Programming on Trees

In this article, we have explored the idea of Dynamic Programming on Trees in depth and presented some practice problems.

Data Structures

Introduction to Tree Data Structure

In this article, we have presented a detailed introduction to Tree Data Structure. This will quickly give you the idea of Tree, how it is implemented and the different types that are used.

Algorithms

Find starting point of loop in linked list

In this article, we have explored three different algorithmic techniques to find starting point of loop in linked list.

computational geometry

Mathematics for Computational Geometry: Circle Theorems, Polygon

In this article, we have covered Mathematics for Computational Geometry focused on 2D Shapes such as Circle properties/ theorems, Polygons and more.

computational geometry

Mathematics for Computational Geometry: Points, Lines, Angles, Circle, Triangle

In this article, we have explored the basics of Mathematics for Computational Geometry including Points, Lines, Angles, Circle, Triangle and other topics.

Algorithms

Mathematics for Analyzing Algorithms

In this article, we are going to explore about mathematics involved in analyzing algorithms and calculate Time Complexity.

Time Complexity

Recurrence Tree Method for Time Complexity

In this article, we have explored Recurrence Tree Method for calculating Time Complexity of different algorithms.

Time Complexity

Substitution Method for Time Complexity

In this article, we have presented the Substitution method for finding the Time complexity of an algorithm in detail.

Algorithms

Detect Cycle in Undirected Graph using Union Find algorithm

In this article, we've explored the approach to detect a cycle in undirected graph using union-find algorithm. This takes O(VE) Time Complexity.

Time Complexity

Amortized Time Complexity

In this article, we have explored the concept of Amortized Time Complexity by taking an example and compared it with a related concept: Average Case Time Complexity.

Culture

OpenGenus Visual Documentation

In this article, we give a detailed documentation of the development of OpenGenus Visual project which is an open-source Visualization tool for Algorithms and Data Structures.

computational geometry

Art Gallery Problem

In this article, we have explored Art Gallery Problem in depth along with variants of Art Gallery Problem and important results.

Algorithms

Data Structure for Spreadsheet / Excel

In this article, we have explored several Data Structures that are used in Spreadsheet / Excel Sheet. These involve ideas like Sparse Matrix, AVL Tree and much more.

Problems on Binary Tree

Select Random Node from Binary Tree

In this article, we have presented two algorithms to select a random node from Binary Tree while maintaining the uniform randomness.

List of Mathematical Algorithms

Firoozbakht’s conjecture

In this article, we have explored Firoozbakht’s conjecture in depth. Firoozbakht's conjecture is linked to upper limits for the prime gap function in terms of n. Asymptotic outcomes for both the conjecture and the function help us understand the interrelationships.

Algorithms

Cayley’s formula

In this article, we have explained the idea of Cayley’s formula which is used to find the number of trees with N nodes and M connected components. We have presented an implementation to calculate Cayley’s formula.

computational geometry

Check if 4 Line Segments form a Rectangle

In this article, we will solve the problem of Check if 4 Line Segments form a Rectangle. This is a core problem of Computational Geometry.

Time Complexity

Time and Space Complexity of Circular Linked List

In this article, we have explored Time and Space Complexity of Circular Linked List. We have covered different cases like Worst Case, Average Case and Best Case.

Time Complexity

Time and Space complexity of Binary Search Tree (BST)

In this article, we are going to explore and calculate about the time and space complexity of binary search tree operations.

Time Complexity

Time and Space Complexity of Red Black Tree

In this article, we will look at the Time and Space Complexity analysis of various Red-Black Tree operations including searching, inserting, and deleting for worst, best, and average cases.

Time Complexity

Time and Space Complexity of Stooge Sort

In this article, we will be discussing the time and space complexity of Stooge Sort covering various cases like Worst, Best and Average Case.

Data Structures

Array Data Structure

In this article, we have explored Array Data Structure in depth. We explore key ideas in Array and how we develop our own custom implementation of Array along with different Array operations.