From 770355cfbe549cc518cd385386a746dc81f38b4a Mon Sep 17 00:00:00 2001
From: Kevin Chang <kevincchang13@gmail.com>
Date: Mon, 31 Jul 2017 16:17:44 -0700
Subject: [PATCH] completed Big O excercises in the read me file

---
 big_o_exercise/readme.md | 39 +++++++++++++++++++++++++++++++++++++++
 1 file changed, 39 insertions(+)

diff --git a/big_o_exercise/readme.md b/big_o_exercise/readme.md
index c732b1d..114b93c 100644
--- a/big_o_exercise/readme.md
+++ b/big_o_exercise/readme.md
@@ -5,15 +5,35 @@
 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 +48,10 @@ function logUpTo(n) {
         console.log(i);
     }
 }
+Time: O(n)
+Space: O(1)
+
+
 
 // 2. 
 
@@ -36,6 +60,9 @@ function logAtMost10(n) {
         console.log(i);
     }
 }
+Time: O(n)
+Space: O(1) 
+
 
 // 3. 
 
@@ -44,6 +71,10 @@ function logAtLeast10(n) {
         console.log(i);
     }
 }
+Time: O(n)
+Space: O(1)
+
+
 
 // 4.
 
@@ -56,6 +87,10 @@ function onlyElementsAtEvenIndex(array) {
     }
     return newArray;
 }
+Time: O(n)
+Space: O(n) 
+
+
 
 // 5. 
 
@@ -70,4 +105,8 @@ function subtotals(array) {
     }
     return subtotalArray;
 }
+
+Time: O(n^2)
+Space: O(n)
+
 ```