My vote is for O(n^2).
**Why?**
-
Now, I know it’s the worst(in terms of speed) but my reason for picking it is because I saw in the graph, that given our isogram = 6 and in our game there will be only one word, the margin of speed doesn’t really make that much of an impact and our code can run well with it.
-
I decided to vote for this one because it’s the best I understand at this point, when writing this post.
-
I know O(n) it’s the fastest and for longer words works best, but I still can’t see the complete picture as to how they operate in code differently. (How, apart from speed, can this affect the loop and/or our code?)
-
If someone reads this, may I also ask;
In what situations would be best to use O(n), O(n log n) and O(n^2)? …
Can they also be used together in some cases? …
I think these questions can open my mind to understanding them more!
Thanks in advance, to whoever read my post!
I really appreciate that!