mvp

Short-Answer/Algorithms_Answers.md

@@ -2,13 +2,12 @@
 
 ## Exercise I
 
-a)
+a) Linear
 
 
-b)
+b) The iteration increase the time
 
-
-c)
+c) no looping since it's only called once
 
 ## Exercise II
 

Short-Answer/Algorithms_Questions.md

@@ -11,6 +11,8 @@ a)  a = 0
       a = a + n * n
 ```
 
+it's a single while loop so it 0(n)
+
 
 ```
 b)  sum = 0
@@ -20,6 +22,7 @@ b)  sum = 0
         j *= 2
         sum += 1
 ```
+This is a nested loop 0(n^2)
 
 ```
 c)  def bunnyEars(bunnies):
@@ -28,6 +31,7 @@ c)  def bunnyEars(bunnies):
 
       return 2 + bunnyEars(bunnies-1)
 ```
+0(n) it's a recursion.
 
 ## Exercise II
 

recursive_count_th/count_th.py

@@ -4,7 +4,14 @@
 Your function must utilize recursion. It cannot contain any loops.
 '''
 def count_th(word):
+    if not word:
+        return 0
+    elif word[:2] == 'th':
+        return 1 + count_th(word[2:])
+    else:
+        return count_th(word[1:])
+
 
     # TBC
 
-    pass
+    # pass

robot_sort/robot_sort.py

@@ -97,7 +97,22 @@ def sort(self):
         Sort the robot's list.
         """
         # Fill this out
-        pass
+        if self.can_move_right() == False:
+            return
+
+        self.swap_item()
+
+        while self.can_move_right():
+            self.move_right()
+            if self.compare_item() == 1:
+                self.swap_item()
+
+        while self.compare_item() is not None:
+            self.move_left()
+
+        self.swap_item()
+        self.move_right()
+        self.sort()
 
 
 if __name__ == "__main__":