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.
-
Notifications
You must be signed in to change notification settings - Fork 0
bhanuvikasr/Auto-Complete
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Implemented text Auto-complete feature from scratch
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published