This commit is contained in:
parent
98d51273d9
commit
60fd331394
|
@ -0,0 +1,8 @@
|
|||
Important concepts
|
||||
|
||||
Big O is a way to categorize your algorithms time or memory requirements based on input.
|
||||
|
||||
- Growth is with respect to the input
|
||||
- Constants are dropped
|
||||
- Worst case is usually the way we measure
|
||||
|
Loading…
Reference in New Issue