Big-O for Eight Year Olds?
Posted
by Jason Baker
on Stack Overflow
See other posts from Stack Overflow
or by Jason Baker
Published on 2008-09-20T04:59:59Z
Indexed on
2010/05/24
21:31 UTC
Read the original article
Hit count: 223
I'm asking more about what this means to my code. I understand the concepts mathematically, I just have a hard time wrapping my head around what they mean conceptually. For example, if one were to perform an O(1) operation on a data structure, I understand that the amount of operations it has to perform won't grow because there are more items. And an O(n) operation would mean that you would perform a set of operations on each element. Could somebody fill in the blanks here?
- Like what exactly would an O(n^2) operation do?
- And what the heck does it mean if an operation is O(n log(n))?
- And does somebody have to smoke crack to write an O(x!)?
© Stack Overflow or respective owner