https://github.com/msdeep14/complexity-dictionary
Dictionary implementation for comparing running time of Tries, AVL Tree, RedBlack Tree and HashMaps
https://github.com/msdeep14/complexity-dictionary
algorithms-and-data-structures avl-tree complexity complexity-dictionary dictionary hashmap java red-black-trees redblack redblack-tree trie
Last synced: 22 days ago
JSON representation
Dictionary implementation for comparing running time of Tries, AVL Tree, RedBlack Tree and HashMaps
- Host: GitHub
- URL: https://github.com/msdeep14/complexity-dictionary
- Owner: msdeep14
- License: apache-2.0
- Created: 2016-10-08T07:09:50.000Z (over 9 years ago)
- Default Branch: master
- Last Pushed: 2017-05-13T06:30:51.000Z (about 9 years ago)
- Last Synced: 2025-02-25T12:51:34.868Z (over 1 year ago)
- Topics: algorithms-and-data-structures, avl-tree, complexity, complexity-dictionary, dictionary, hashmap, java, red-black-trees, redblack, redblack-tree, trie
- Language: Java
- Homepage:
- Size: 1.8 MB
- Stars: 1
- Watchers: 2
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Complexity-Dictionary
Dictionary implementation for comparing time complexity of Tries, AVL Tree, RedBlack Tree and HashMaps
## Project Design
1. System checks running time of building and searching word in dictionary.
2. Tries, AVL Tree and RedBlack is implemented and HashMaps is used as an inbuilt library.
## Analysis
#### Building dictionary
For building up whole dictionary(36,351 entries), AVL Tree is a clear loser and HashMap and RedBlack Tree has nearly similar build up time.
#### Search
HashMap is a clear winner, while AVL and RedBlack took nearly the same time.
## Development
Complete project is developed on eclipse platform.