Suffix Array Implementation in Bash This document explains how to implement a Suffix Array using Bash. A Suffix Array is a sorted array […]
Author: Aditya Bhuyan
Bash
Bloom Filter Implementation in Bash
Bloom Filter Implementation in Bash This document explains how to implement a Bloom Filter using Bash. A Bloom Filter is a space-efficient probabilistic […]
Bash
Disjoint Set Data Structure Implementation in Bash
Disjoint Set Data Structure Implementation in Bash This document explains the implementation of the Disjoint Set (Union-Find) data structure in Bash. The Disjoint […]
C
Trie (Prefix Tree) Implementation in C
Trie (Prefix Tree) Implementation in C A Trie, also known as a prefix tree, is a tree data structure used for storing a […]
C
Autocomplete System Using Trie in C
Autocomplete System Using Trie in C An autocomplete system is a feature commonly used in search engines, text editors, and other applications to […]
C
Segment Tree Implementation in C
Segment Tree Implementation in C A Segment Tree is a powerful data structure used for answering range queries efficiently, such as sum, minimum, […]
C
Fenwick Tree (Binary Indexed Tree) Implementation in C
Fenwick Tree (Binary Indexed Tree) Implementation in C A Fenwick Tree, also known as a Binary Indexed Tree (BIT), is a data structure […]
C
AVL Tree Implementation in C
AVL Tree Implementation in C An AVL tree is a self-balancing binary search tree where the difference between the heights of the left […]
C
Red-Black Tree Implementation in C
Red-Black Tree Implementation in C A Red-Black Tree is a self-balancing binary search tree where each node has an extra bit for denoting […]
C
B-Tree Implementation in C
B-Tree Implementation in C A B-tree is a self-balancing tree data structure that maintains sorted data and allows for efficient insertion, deletion, and […]
