Insertion Sort Done plus addtional comments

Author: jsantana21

BubbleSort.py

@@ -10,7 +10,7 @@
 Space Complexity: O(1)
 '''
 
-# Based off of Geeks for Geeks Bubble sort example
+# Based off of Geeks for Geeks Bubble sort example: https://www.geeksforgeeks.org/bubble-sort/
 # Another source: https://www.studytonight.com/data-structures/bubble-sort
 def BubbleSort(data, drawDataArray, sortSpeedTime):
     # Traverse through all array elements
@@ -24,6 +24,3 @@ def BubbleSort(data, drawDataArray, sortSpeedTime):
                 drawDataArray(data, ['purple' if x == j or x == j+1 else 'red' for x in range(len(data))] )
                 # Helps us determine how long this function should be asleep for once the user can see each step of this algorithm
                 time.sleep(sortSpeedTime)
-                
-    # After going through the double for loop, the array should be sorted therefore all bars should be blue
-    drawDataArray(data, ['blue' for x in range(len(data))])

InsertionSort.py

@@ -0,0 +1,27 @@
+import time # To help us visualize this algorithm step by step
+
+'''
+Worst Case Time Complexity [ Big-O ]: O(n^2)
+
+Best Case Time Complexity [Big-omega]: O(n)
+
+Average Time Complexity [Big-theta]: O(n^2)
+
+Space Complexity: O(1)
+'''
+
+# Based off of Geeks for Geeks Insertion sort example: https://www.geeksforgeeks.org/insertion-sort/
+# Another source: https://www.studytonight.com/data-structures/insertion-sorting
+def InsertionSort(data, drawDataArray, sortSpeedTime):
+    # Traverse through length of data array
+    for i in range (1, len(data)): 
+        key = data[i]
+        # Move elements of arr[0..i-1], that are > key, to one position ahead of current position
+        j = i-1
+        while j >= 0 and key < data[j]: 
+            data[j + 1] = data[j] 
+            j -= 1
+            # Blue = Done with Sorted, Red = Unsorted, Purple = Being Swap / Being Sorted
+            drawDataArray(data, ['purple' if x == j or x == j + 1 else 'red' for x in range(len(data))])
+            time.sleep(sortSpeedTime)
+        data[j + 1] = key 

MergeSort.py

@@ -9,7 +9,7 @@
 
 Space Complexity: O(n)
 '''
-# Based off of Geeks for Geeks Bubble sort example
+# Based off of Geeks for Geeks Bubble sort example: https://www.geeksforgeeks.org/merge-sort/
 # Another source: https://www.studytonight.com/data-structures/merge-sort#
 def MergeSort(data, drawDataArray, sortSpeedTime):
     MergeSort2(data,0, len(data)-1, drawDataArray, sortSpeedTime)

QuickSort.py

@@ -10,7 +10,7 @@
 Space Complexity: O(n*log n)
 '''
 
-# Based off of Geeks for Geeks Bubble sort example
+# Based off of Geeks for Geeks Bubble sort example: https://www.geeksforgeeks.org/quick-sort/
 # Another source: https://www.studytonight.com/data-structures/quick-sort
 def QuickSort(data, low, high, drawDataArray, sortSpeedTime):
 

__pycache__/BubbleSort.cpython-38.pyc

@@ -4,6 +4,7 @@
 from BubbleSort import BubbleSort
 from QuickSort import QuickSort
 from MergeSort import MergeSort
+from InsertionSort import InsertionSort
 
 
 # Generates a black window; Background for GUI 
@@ -78,6 +79,9 @@ def StartSortingAlgorithm():
     elif algorithmList.get() == 'Merge Sort':
         MergeSort(data, drawDataArray, sortingSpeedScale.get())
 
+    elif algorithmList.get() == 'Insertion Sort':
+        InsertionSort(data, drawDataArray, sortingSpeedScale.get())
+
     # After going through the double for loop, the array should be sorted therefore all bars should be blue
     drawDataArray(data, ['blue' for x in range(len(data))])
 
@@ -95,7 +99,7 @@ def StartSortingAlgorithm():
 # FIRST ROW
 # (Top Left Corner); Algorithm Label (where you can choose which sorting algorithm you want to use)
 Label(UserInterfaceFrame, text="Sorting Algorithm: ", bg='snow4').grid(row=0, column=0, padx=5, pady=5, sticky=W) # W for west aka left
-algorithmList = ttk.Combobox(UserInterfaceFrame, textvariable = selectedAlgorithm, values=['Bubble Sort', 'Quick Sort','Merge Sort'])
+algorithmList = ttk.Combobox(UserInterfaceFrame, textvariable = selectedAlgorithm, values=['Bubble Sort', 'Quick Sort','Merge Sort', 'Insertion Sort'])
 algorithmList.grid(row=0, column=1, padx=5, pady=5)
 algorithmList.current(0) #chooses Bubble Sort by default since it is in index 0