For my programming introduction classes back in university, one of the projects was to do something similar to a pokedex. One of the requirements was to have a search by "name approximation". With "name approximation" the professor meant search for any pokemon that has the given string as a substring in the name, but what we interpreted by that was to search by similar texts as the one given.
So we ended up over engineering the search so if the search that you do have a typo in the name or it is phonetically similar to other pokemon it will show up. For example, if you searched for hivisor it will match with ivysaur.
This might not be the coolest thing I have worked on, but for sure is my favorite because we had a lot of fun trying to figure out how to do it and also testing the craziest searches to see how far it could go. Also even though this was not the professor requested he decided to accepted because he thought it was so cool.
As fun fact, one day I stumble with the project and decided to check the code. It turns out that search should not be working at all, the algorithm makes no sense for what it is supposed to do. But it does work xDDD
For further actions, you may consider blocking this person and/or reporting abuse
We're a place where coders share, stay up-to-date and grow their careers.
For my programming introduction classes back in university, one of the projects was to do something similar to a pokedex. One of the requirements was to have a search by "name approximation". With "name approximation" the professor meant search for any pokemon that has the given string as a substring in the name, but what we interpreted by that was to search by similar texts as the one given.
So we ended up over engineering the search so if the search that you do have a typo in the name or it is phonetically similar to other pokemon it will show up. For example, if you searched for hivisor it will match with ivysaur.
This might not be the coolest thing I have worked on, but for sure is my favorite because we had a lot of fun trying to figure out how to do it and also testing the craziest searches to see how far it could go. Also even though this was not the professor requested he decided to accepted because he thought it was so cool.
As fun fact, one day I stumble with the project and decided to check the code. It turns out that search should not be working at all, the algorithm makes no sense for what it is supposed to do. But it does work xDDD