This repository was developed alongside with @Thodwrhs Myridis during the course Data Structures on the 2nd Semester of our studies in CSD AUTH and contains implementations of a binary tree, an AVL tree and a hash table with open addressing. These data structures were implemented for comparison on search times for words of a txt file. For this comparison, besides the three data structures there were also other classes implemented for handling, text processing and comparison on search times. Also, for "predicting" the correct size of the hash table a linear model using least squares method was implemented.
-
Notifications
You must be signed in to change notification settings - Fork 0
This project was developed during the course Data Structures in the 2nd semester of Computer Science Department of Aristotle University of Thessaloniki
License
apapadoi/Data-Structures-Project
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
This project was developed during the course Data Structures in the 2nd semester of Computer Science Department of Aristotle University of Thessaloniki