Loading collection data...
Collections are a way for you to organize kata so that you can create your own training routines. Every collection you create is public and automatically sharable with other warriors. After you have added a few kata to a collection you and others can train on the kata contained within the collection.
Get started now by creating a new collection.
I think this solution is difficult.Please, read about Big^O^notation
Overriding the prototype is definitely not a good practice.
But other than that, this code is simple and that is a good thing.
Sure, it won't be optimal for running anagramm checks for millions of items, but that was not a requirement. Usually if something has to handle big data you know either because it is obvious from the context, or you are told that.
In this case premature optimization would only made the code more complex and thus harder to read and understand. And that can be bad.
The speed of sort is irrelevant for an array of a couple of items and only a handful of invocations. Readability and maintainability is way more important for such cases.
I literally did the same, just because I could. But this is bad. First it's goes N 3 times also sort! and ther are rumors for messing with prototype is no good.
sorting a word on every iteration consume extra cpu, rather you can sort word once and use it in filter
sort is very slow. Definitely not a best practice
Nice
Nice code!
It is best practice because people voted for it. Always, not, but very often top best practice voted solution are not good practice at all... Take it easy, and vote for the real best practice according to you ;)
I'm new here, anyone could explain me why this solution is considered best practices?
Maybe I'm worng but:
less code !== (better code || best practices)
Is this always like that? :(
This is the best practice solution I have seen so far.
Like the solution, However I'd not try to mess with prototype of built-in objects
i'm not sure modifying the built-in function is recommended.
nice one :)
True. I read somewhere though that Big O notation specifically focuses on the worst case scenario. So I'd assume when dealing with conditionals you have to take whichever branch that will result in the largest runtime, meaning you have to include the splice. Not sure about that though I'll have to look it up.
See - 2. if-then-else statements:
http://pages.cs.wisc.edu/~vernon/cs367/notes/3.COMPLEXITY.html#application
Loading more items...