re: Algorithms and Data Structures in JavaScript VIEW POST

TOP OF THREAD FULL DISCUSSION
re: O (n2) is not horrible. If you problem is matrix multiplication, the you're a god if you do it in O (n2). The complexity is relative to the problem...
 

Hi Isaac,

I think the chart was taken from bigocheatsheet.com/ and there it mainly talks about data structure operations (read, insert, update, delete) and sorting algorithms.

I agree with you that to say a complexity is bad cannot be done independently of the problem.

 
code of conduct - report abuse