Big O exercise

big_o_exercise/readme.md

@@ -5,15 +5,25 @@
 Simplify the following big O expressions as much as possible:
 
 1. `O(n + 10)`
+O(n)
 2. `O(100 * n)`
+O(n)
 3. `O(25)`
+O(1)
 4. `O(n^2 + n^3)`
+O(n^3)
 5. `O(n + n + n + n)`
+O(n)
 6. `O(1000 * log(n) + n)`
+O(log(n))
 7. `O(1000 * n * log(n) + n)`
+O(n * log(n))
 8. `O(2^n + n^2)`
+O(n^2)
 9. `O(5 + 3 + 1)`
+O(1)
 10. `O(n + n^(1/2) + n^2 + n * log(n)^10)`
+O(n^2)
 
 ### Part 2
 
@@ -28,6 +38,8 @@ function logUpTo(n) {
         console.log(i);
     }
 }
+Time: O(n)
+Space: O(1)
 
 // 2. 
 
@@ -36,6 +48,8 @@ function logAtMost10(n) {
         console.log(i);
     }
 }
+Time: O(n)
+Space: 0(1)
 
 // 3. 
 
@@ -44,6 +58,8 @@ function logAtLeast10(n) {
         console.log(i);
     }
 }
+Time: O(n)
+Space: 0(1)
 
 // 4.
 
@@ -56,6 +72,8 @@ function onlyElementsAtEvenIndex(array) {
     }
     return newArray;
 }
+Time: O(n)
+Space: O(n)
 
 // 5. 
 
@@ -70,4 +88,7 @@ function subtotals(array) {
     }
     return subtotalArray;
 }
+Time: 0(n^2)
+Space: O(n)
+
 ```