https://github.com/bhanuvikasr/auto-complete
Implemented text Auto-complete feature from scratch
https://github.com/bhanuvikasr/auto-complete
binary-search-tree hashset ternary-search-tree
Last synced: about 1 year ago
JSON representation
Implemented text Auto-complete feature from scratch
- Host: GitHub
- URL: https://github.com/bhanuvikasr/auto-complete
- Owner: bhanuvikasr
- Created: 2017-05-23T01:14:01.000Z (about 9 years ago)
- Default Branch: master
- Last Pushed: 2017-05-23T01:43:33.000Z (about 9 years ago)
- Last Synced: 2025-03-24T11:52:48.677Z (over 1 year ago)
- Topics: binary-search-tree, hashset, ternary-search-tree
- Language: C++
- Homepage:
- Size: 127 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Auto Complete in C++
In this assignment we implemented a ternary search tree (TST) data structure for strings. Also, text auto-complete functionality was implemented using dictionary ADT with 3 different datastructures (Balanced BST, TST, HashSet). To analyse the performance, compared the empirical running time of TSTs, Balanced Binary Search Trees and Hash Tables to their expected analytical running times. And, we researched and compared the performance of different hash functions for strings.