Michael Agard

.gitignore

@@ -0,0 +1 @@
+__pycache__

project/iterative_sorting.py

@@ -1,36 +1,43 @@
 # Complete the selection_sort() function below in class with your instructor
-def selection_sort( arr ):
+
+
+def selection_sort(arr):
     # loop through n-1 elements
     for i in range(0, len(arr) - 1):
         cur_index = i
         smallest_index = cur_index
         # TO-DO: find next smallest element
-        # (hint, can do in 3 loc) 
-
-
-
-
-        # TO-DO: swap
-
-
-
-
+        # # (hint, can do in 3 loc)
+        for j in range(cur_index, len(arr)):
+            if arr[j] < arr[smallest_index]:
+                smallest_index = j
+                # TO-DO: swap
+        arr[cur_index], arr[smallest_index] = arr[smallest_index], arr[cur_index]
     return arr
 
-
 # TO-DO: implement the Insertion Sort function below
-def insertion_sort( arr ):
 
+
+def insertion_sort(arr):
+    for i in range(1, len(arr)):
+        cur_index = i
+        while cur_index > 0 and arr[cur_index] < arr[cur_index - 1]:
+            temp = arr[cur_index - 1]
+            arr[cur_index - 1] = arr[cur_index]
+            arr[cur_index] = temp
+            cur_index -= 1
     return arr
 
 
 # STRETCH: implement the Bubble Sort function below
-def bubble_sort( arr ):
+
+
+def bubble_sort(arr):
 
     return arr
 
 
 # STRETCH: implement the Count Sort function below
-def count_sort( arr, maximum=-1 ):
+def count_sort(arr, maximum=-1):
 
-    return arr
+    return arr

readme.md

@@ -277,3 +277,5 @@ While ***Quick Sort*** has "quick" in its name, it is typically not used as freq
 - What programming languages use **Timsort** to implement their built-in `sort()` functions?
 - If an interviewer asked you to describe the **Tim Sort** algorithm in 3-4 sentences, what would you say?
 - Can you implement **Tim Sort** in Python?
+
+PR: https://github.com/LambdaSchool/Sorting/pull/2