Add shorter version of Algorithms problems document

Author: seanchen1991

algorithms/Algorithms_Questions.md

@@ -0,0 +1,24 @@
+# Analysis of Algorithms
+**Exercise I**: _Give an analysis of the running time of each snippet of pseudocode with respect to the input size n of each of the following:_
+```
+a)  a = 0
+    while (a < n * n * n) 
+      a = a + n * n
+```
+```
+b)  sum = 0
+    for (i = 0; i < n; i++)
+      for (j = i + 1; j < n; j++)
+        for (k = j + 1; k < n; k++)
+          for (l = k + 1; l < 10 + k; l++)
+            sum++
+```
+```
+c)  bunnyEars = function(bunnies) {
+      if (bunnies == 0) return 0
+      return 2 + bunnyEars(bunnies-1)
+    }
+```
+
+**Exercise II**:
+Suppose that you have an _n_-story building and plenty of eggs. Suppose also that an egg gets broken if it is thrown off floor _f_ or higher, and doesn't get broken if dropped off a floor less than floor _f_. Devise a strategy to determine the value of _f_ such that the number of dropped eggs is minimized.

data_structures/ex_2/heap.py

@@ -1,5 +1,6 @@
 def heapsort(arr):
  pass 
+ 
 
 class Heap:
   def __init__(self):