diff --git a/big_o_exercise/bigOExcercise.txt b/big_o_exercise/bigOExcercise.txt
new file mode 100644
index 0000000..e183a8d
--- /dev/null
+++ b/big_o_exercise/bigOExcercise.txt
@@ -0,0 +1,86 @@
+# Big O Notation Exercises
+
+### Part 1
+
+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(n)
+7. O(1000 * n * log(n) + n) > O(nlog(n))
+8. O(2^n + n^2) > O(2^n)
+9. O(5 + 3 + 1) > O(1)
+10. O(n + n^(1/2) + n^2 + n * log(n)^10) > O^2)
+
+### Part 2
+
+Determine the time and space complexities for each of the following functions. If you're not sure what these functions do, copy and paste them into the console and experiment with different inputs!
+
+
+// 1.
+
+function logUpTo(n) {
+    for (var i = 1; i <= n; i++) {
+        console.log(i);
+    }
+}
+
+Time Complexity: O(n)
+Space Complexity: O(1)
+
+// 2. 
+
+function logAtMost10(n) {
+    for (var i = 1; i <= Math.min(n, 10); i++) {
+        console.log(i);
+    }
+}
+
+Time Complexity: O(1)
+Space Complexity: O(1)
+
+// 3. 
+
+function logAtLeast10(n) {
+    for (var i = 1; i <= Math.max(n, 10); i++) {
+        console.log(i);
+    }
+}
+
+Time Complexity: O(1) if n < 10. O(n) if n > 10
+Space Complexity: O(1)
+
+// 4.
+
+function onlyElementsAtEvenIndex(array) {
+    var newArray = Array(Math.ceil(array.length / 2));
+    for (var i = 0; i < array.length; i++) {
+        if (i % 2 === 0) {
+            newArray[i / 2] = array[i];
+        }
+    }
+    return newArray;
+}
+
+Time Complexity: O(n)
+Space Complexity: O(n)
+
+// 5. 
+
+function subtotals(array) {
+    var subtotalArray = Array(array.length);
+    for (var i = 0; i < array.length; i++) {
+        var subtotal = 0;
+        for (var j = 0; j <= i; j++) {
+            subtotal += array[j];
+        }
+        subtotalArray[i] = subtotal;
+    }
+    return subtotalArray;
+}
+
+Time Complexity: O(n^2)
+Space Complexity: O(n)