News for hackers. Stuff that matters.
Re:Big-O Algorithm Complexity Cheat Sheet by calebegg on Saturday May 04, 2013 @05:06PM (#5656325)
Why is O(n) red and O(n log(n)) yellow? Clearly, O(n log(n)) is slower.

In general, whether a specific complexity is good or bad differs greatly based on what you're doing. I don't think it's a good idea to have the colors be the same everywhere. A particularly bad instance is how every single data structure is O(n), which is red/"bad".

There are no comments on this comment yet.