Aswin Shailajan - OpenGenus IQ: Computing Expertise & Legacy

Spell Checker in C

In this article, we have developed a Spell Checker tool in C Programming Language. It takes a string as input, highlight the words with wrong spelling and makes possible suggestions for each wrong word.

Data Structures

Applications of 24 Different Data Structures

In this article, we have listed and explained the real-life applications of 24 Different Data Structures ranging from common ones like Array, Linked List to Geometric Data Structures like R-Tree to Probabilistic Data Structures like LogLog.

Time Complexity

Time and Space Complexity of B+ Tree

B+ trees an interesting name isn't it? So in this article, we will closely analyze the time & space complexities for different operations in different cases of B+ Tree Data Structure.

Data Structures

(a,b) Tree Data Structure

An (a,b)-tree is a type of self-balancing tree data structure that is designed to maintain a balance between the height of the tree and the number of elements stored in the tree. In short we can say that (a,b)-tree is a generalization of a B-tree. Now lets get to know it in depth.

Graph Algorithms

Biconnected Components [Explained + Algorithm to find it]

Turns out, biconnected components are one of the most important topic in design analysis of algorithms, data structures and in many competitive exams. Biconnected components are defined as a maximal biconnected subgraph.

C++

Determine index from pointers in C++

In this article, we will look at how to compute the index using pointers returned by STL functions. It will be explained in such a way that even a 4th grader would get it.