The basic implementation followed so far is... basic. Many loops and not the best performance. Many inefficient loops et al.
It would be cool to make the implementations fast, although do I want to retain some readability/maintainability factor (over performance) given the nature of the project? Could theoretically have high perf versions for each language.
To quote Linus...
It's wrong. It's stupid.
Congratulations, you seem to have found a whole new and unique way of screwing up ;) Linus “my mom called me ‘special’ too” Torvalds
Ugh, this is disgusting.
Ideas:
Measure and document the time complexity of each implementation
Instead of looping every stop word for every insult word, we could concat them into a predictable string and check for a substring
Looping all characters of a string to strip non-letters is probably less efficient than a direct replacement method
The basic implementation followed so far is... basic. Many loops and not the best performance. Many inefficient loops et al.
It would be cool to make the implementations fast, although do I want to retain some readability/maintainability factor (over performance) given the nature of the project? Could theoretically have high perf versions for each language.
To quote Linus...
Ideas: