Questions answered, sprint complete

Author: ericwhitcomb

Data_Structures_Answers.md

@@ -2,17 +2,34 @@ Add your answers to the questions below.
 
 1. What is the runtime complexity of your ring buffer's `append` method?
 
+O(1)
+
 2. What is the space complexity of your ring buffer's `append` function?
 
+O(1)
+
 3. What is the runtime complexity of your ring buffer's `get` method?
 
+O(n)
+
 4. What is the space complexity of your ring buffer's `get` method?
 
+O(n)
 
 5. What is the runtime complexity of the provided code in `names.py`?
 
+O(n)
+
 6. What is the space complexity of the provided code in `names.py`?
 
+O(2n)
+
 7. What is the runtime complexity of your optimized code in `names.py`?
 
+O(logn)
+
 8. What is the space complexity of your optimized code in `names.py`?
+
+Not sure if this counts as O(n) or O(2n). Having the two lists is a bit
+confusing. Final answer, O(2n)
+