In this project I decided to do a software that recommends games from my own Nintendo Switch library based on selected categories.
In this project I implemented a lot of the lessons learnt in CS102 - Data Structures & Algorithms. I used a Trie as my search algorithm.
I hope you like it and welcome all feedback, the more brutal, the better 
1 Like
Wow I love what you did with presenting your information. Everything is colour coded, centered and very legible. Wish I knew more about Trie and Trie Nodes to comment on your actual code. Amazing job
1 Like
Hey Gabe!
Thank you so much for taking the time to look at my project and for your kind words, I really appreciate it! 
Tries are pretty cool. You can essentially store data in each node in the tree, so the way I used it in this case was to store each of the words in the categories I had letter by letter. So if you have a few words (Iโll make some up) it would get stored like a tree something like so:
Type โacโ for example, it would return anything thatโs under a โ c โ in this case, โactโ and โaccโ will be returned.
1 Like