I'm a very straightforward data science student in last year before master graduation. I like to learn bottom-up step by step and go through the logical discovery process myself as much as possible
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. Also, time complexity should be considered together with space complexity. If you can sort in O(n) time wih O(n2) it might be not that good, but it depends on the size of your data. For small data you can afford to store O(n2). A good complexity table is the one of "data structure complexity in c++" which compares operation for different data structs
My professional interests are cloud and big data technologies, machine learning, and software development. I like to read source code and research papers to understand how stuff works.
Pronoun: He
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.
I'm a very straightforward data science student in last year before master graduation. I like to learn bottom-up step by step and go through the logical discovery process myself as much as possible
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. Also, time complexity should be considered together with space complexity. If you can sort in O(n) time wih O(n2) it might be not that good, but it depends on the size of your data. For small data you can afford to store O(n2). A good complexity table is the one of "data structure complexity in c++" which compares operation for different data structs
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.
Yeah exactly thats the cheatsheet I had in mind :)