finished questions

Author: Dstar4

Data_Structures_Answers.md

@@ -1,18 +1,19 @@
 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^2) - nested for loop
 6. What is the space complexity of the provided code in `names.py`?
-
+O(n)
 7. What is the runtime complexity of your optimized code in `names.py`?
-
+O(n)
 8. What is the space complexity of your optimized code in `names.py`?
+O(1)

ring_buffer/ring_buffer.py

@@ -12,6 +12,7 @@ def __init__(self, capacity):
     def append(self, item):
         # print(self.current)
         # print(self.storage)
+
         # replaces the item for the "current" index
         self.storage[self.current] = item
         # check that our current position is not beyond the lists length