-
### Is there an existing issue for this?
- [X] I have searched the existing issues
### Feature Description
### The B-tree is a self-balancing multi-way tree data structure that maintains so…
-
Hi, I would like to contribute codes about :
AVL -> An AVL tree is a self-balancing Binary Search Tree (BST). In an AVL tree, the heights of the two child sub-trees of any node differ by at most one,…
-
We currently use `std::map` for `Mul`s. Since a typical `Mul` has just a few factors, it probably doesn't matter at all.
However, for `Add`s, the standard `std::map` seems slower than `std::unordered…
-
## The next optimizing/benchmarking shall be searching.
We shall test the following
1. Binary Search:
• Best for: Sorted arrays or lists.
• Time complexity: O(\log n)
• Description: Divides th…
-
**Description**:
The current implementation of `crdt.Array` is based on `RGATreeList`, which uses both `SplayTree` and `LLRBTree` for internal element retrieval. While this structure works, the…
-
### What would you like to Propose?
**What would I like to propose?**
A treap (short for "tree heap") is a type of balanced binary search tree that combines properties of both a binary search tree…
-
Source code and explanation needed to fully explain the following,
- [ ] Hashing
- [ ] Heap
- [ ] Binary Tree
- [ ] Splay
- [ ] Trie
-
### Idea Contribution
- [X] I have read all the resource request issues.
- [X] I'm interested in working on this issue
- [X] I'm part of GSSOC organization
### Where do you want to add the resource?…
-
## Background
**What is your motivation?**
The current `WeightedIndex` is pretty good. Lookups perform very well. And while it's possible to do updates, they are potentially slow as the (average) …
-
[Algorithm Design and Applications.pdf](https://github.com/henryliangt/usyd/files/9442733/Algorithm.Design.and.Applications.pdf)
[Algorithm_Design_and_Applications_----_(5.1_Priority_Queues_).pdf](ht…