Done

jsantana21 · jsantana21 · commit 51921475d4f1 · 2020-11-08T22:53:55.000-05:00
diff --git a/BubbleSort.py b/BubbleSort.py
@@ -7,8 +7,8 @@
 
 Average Time Complexity [Big-theta]: O(n^2)
 
-Space Complexity: O(1)
-'''
+Space Complexity: O(1) 
+''' 
 
 # 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
diff --git a/InsertionSort.py b/InsertionSort.py
@@ -7,7 +7,7 @@
 
 Average Time Complexity [Big-theta]: O(n^2)
 
-Space Complexity: O(1)
+Space Complexity: O(1) 
 '''
 
 # Based off of Geeks for Geeks Insertion sort example: https://www.geeksforgeeks.org/insertion-sort/
diff --git a/MergeSort.py b/MergeSort.py
@@ -5,7 +5,7 @@
 
 Best Case Time Complexity [Big-omega]: O(n*log n)
 
-Average Time Complexity [Big-theta]: O(n*log n)
+Average Time Complexity [Big-theta]: O(n*log n) 
 
 Space Complexity: O(n)
 '''
diff --git a/QuickSort.py b/QuickSort.py
@@ -7,7 +7,7 @@
 
 Average Time Complexity [Big-theta]: O(n*log n)
 
-Space Complexity: O(n*log n)
+Space Complexity: O(n*log n) 
 '''
 
 # Based off of Geeks for Geeks Bubble sort example: https://www.geeksforgeeks.org/quick-sort/
diff --git a/sortingAlgorithmVisualizer.py b/sortingAlgorithmVisualizer.py
@@ -66,7 +66,7 @@ def GenerateNewArray():
 def StartSortingAlgorithm():
     global data
 
-    # If data is empty then return out of it
+    # If data is empty then return out of it 
     if not data:
         return
 
