Akanksha Singh - OpenGenus IQ: Computing Expertise & Legacy

Perlin Noise (with implementation in Python)

One of the most important algorithms in computer graphics and procedural generation is Perlin Noise. Perlin Noise is an algorithm that generates textures and terrain-like images procedurally (without the need for an artist to manually create the images).

Data Communication and Computer Networks

Distance Vector in Computer Network

In this article, we have covered the idea of Distance Vector in Computer Network in depth along with Routing and Distance Vector Routing protocol.

Data Structures

Binary Search Tree with Parent Pointer

In this article, we have covered Binary Search Tree with Parent Pointer which is a modification of the standard Data Structure, Binary Tree.

computational geometry

Euler’s Polyhedron Formula

In this article, we have explored Euler’s Polyhedron Formula in depth with examples, proof and applications in real life problems.

Algorithms

Parallel Bubble Sort

In this article, we have explored how to implement Bubble Sort in parallel on multiple threads / cores. We have presented two approaches: one is slower than the sequential approach but the other approach is significantly faster than all other approaches for large input.

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 Heap Sort

In this article, we have explained Time & Space Complexity of Heap Sort with detailed analysis of different cases like Worst case, Best case and Average Case.

Algorithms

Merge K sorted Linked Lists

We have explained 3 different algorithms to Merge K sorted Linked Lists such that the final Linked List is also sorted.

Algorithms

Longest substring without repeating characters

In this article, we have explained three approaches to the problem of finding Longest substring without repeating characters. This involves the use of Hash Map with the clever use of start and end index.

Algorithms

Median of two sorted arrays

In this article, we have presented 3 Algorithms to find the Median of two sorted arrays efficiently in logarithmic time. This involves a clever use of Binary Search algorithm.

Algorithms

Intersection of two arrays

We have explored several approaches to find Intersection of two arrays efficiently. This involve techniques like sorting, binary search, hash map and much more.

Algorithms

Implement Bubble sort in a list in Python

We have explained the basic of Bubble Sort along with a detailed explanation of Python implementation of Bubble Sort in a list.