Basics
Julia implementations of basic algorithms and data structures
Implementations list
| Algo | Source reference |
|---|---|
| Linked list | LinkedLists.jl |
| Skip list | SkipLists.jl |
Running tests
julia --project -e 'using Pkg; Pkg.test()'TODO
See Trello board
Julia
- Implement Linked list in Julia
- Implement Skip list in Julia
- Customizable item comparison operator for Skip list
- Implement Hash table in Julia
- Implement Heap in Julia
- Implement Binary search tree in Julia
- Implement Radix tree (trie) in Julia
- Implement Rope in Julia
- Implement B* tree in Julia
- Implement Split Hashtables in Julia
Python
- Implement Linked list in Python
- Implement Skip list in Python
- Implement Hash table in Python
- Implement Heap in Python
- Implement Binary search tree in Python
- Implement Radix tree (trie) in Python
- Implement Rope in Python
- Implement B* tree in Python
- Implement Split Hashtables in Python
Tooling
- Make benchmarking test cases file format
- Make benchmarking tool
- Make Julia benchmarking CLI application
- Make Python benchmarking CLI application