Here are some classic algorithms implemented using Moonbit. This repository aims to show you how to implement data structures and algorithms in a more than easy way. For development use, please refer to moonbitlang/core.
Welcome to contribute!!! specific reference here.
| Name | State | Remarks |
|---|---|---|
| Cons List | Finished | - |
| Stack | Finished | - |
| Queue(Mutable) | Finished | - |
| Queue(Immutable) | Unfinished | - |
| LinkedList | Unfinished | - |
| Set(Mutable) | Unfinished | - |
| Set(Immutable) | Unfinished | - |
| Map(Mutable) | Unfinished | - |
| Map(Immutable) | Unfinished | - |
| HashSet(Mutable) | Unfinished | - |
| HashSet(Immutable) | Unfinished | - |
| HashMap(Mutable) | Unfinished | - |
| HashMap(Immutable) | Unfinished | - |
| Heap(Binary) | Finished | - |
| Heap(Pairing) | Unfinished | - |
| Leftist Tree(Mutable) | Unfinished | - |
| Leftist Tree(Immutable) | Unfinished | - |
| Union-Find Set(Mutable) | Finished | - |
| Union-Find Set(Immutable) | Unfinished | - |
| Segment Tree(Mutable, no lazy) | Finished | - |
| Segment Tree(Mutable, lazy) | Unfinished | - |
| Segment Tree(Immutable) | Unfinished | - |
| BST | Unfinished | - |
| Treap(Mutable) | Unfinished | - |
| Treap(Immutable) | Unfinished | - |
| Splay | Unfinished | - |
| AVL | Finished | - |
| RBT | Unfinished | - |
| Trie(Mutable) | Unfinished | - |
| Trie(Immutable) | Unfinished | - |
| Finger Tree | Unfinished | - |
| Binary Exponentiation | Unfinished | - |
| KMP | Finished | - |
| Sort | Unfinished | There are too many algorithms of this sorting and they are always in an unfinished state. Welcome to contribute different sorting algorithms! |
You can participate in contributing to unfinished questions through Pull Request at any time! Please refer to existing algorithms to write commit formats, main files, and test files.