ChawnChrstian

Short-Answer/Algorithms_Answers.md

@@ -3,13 +3,22 @@
 ## Exercise I
 
 a)
-
+Single while statements causes O(n)
 
 b)
-
+Nested loops create (O(n^2))
 
 c)
-
+Single if statements that will eventually lead to 0 creates O(n)
 ## Exercise II
 
+i = 0
+while f == i:
+    if egg= unbroken:
+    i ++
+
+    else:
+    return i
+this should be O(log n)
+
 

recursive_count_th/count_th.py

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

robot_sort/robot_sort.py

@@ -96,8 +96,34 @@ def sort(self):
         """
         Sort the robot's list.
         """
-        # Fill this out
-        pass
+        while not self.light_is_on():
+            self.set_light_on()
+
+            while self.can_move_right():
+                self.swap_item()
+                self.move_right()
+
+                if self.compare_item() == 1:
+                    self.swap_item()
+                    self.set_light_off()
+
+                self.move_left()
+                self.swap_item()
+                self.move_right()
+
+
+
+            while self.can_move_left():
+                self.swap_item()
+                self.move_left()
+
+                if self.compare_item() == -1:
+                    self.swap_item()
+                    self.set_light_off()
+
+                self.move_right()
+                self.swap_item()
+                self.move_left()
 
 
 if __name__ == "__main__":