Project header:
Implement the following data structures in C++ to the best of your abilities:
- Unsorted array
- Sorted array
- Simple binary search tree
- AVL binary search tree
- Hash table
Use the data of the given input.txt file* to time these structures against each other, based on the time it takes them to insert the above document and search and delete a sample of 1000 words from the same document (pick these words however you like). Print these stats to the screen. Take note that some words in this file may be garbled, so you should normalize them to just lowercase latin characters and numbers. Work in pairs.
Notes:
- This project is from our second semester, therefore the original header has been lost and the provided code is basically ancient
- This document* was 30GB heavy so even if I still had it I doubt I could (or should) have uploaded it here
Project courtesy of Aristotle University of Thessalonica, CSD.