Big O notation comments added

Author: jsantana21

BubbleSort.py

@@ -1,6 +1,17 @@
 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 Bubble sort example
+# Another source: https://www.studytonight.com/data-structures/bubble-sort
 def BubbleSort(data, drawDataArray, sortSpeedTime):
     # Traverse through all array elements
     for _ in range(len(data)-1):

MergeSort.py

@@ -1,5 +1,16 @@
 import time # To help us visualize this algorithm step by step
 
+'''
+Worst Case Time Complexity [ Big-O ]: O(n*log n)
+
+Best Case Time Complexity [Big-omega]: O(n*log n)
+
+Average Time Complexity [Big-theta]: O(n*log n)
+
+Space Complexity: O(n)
+'''
+# Based off of Geeks for Geeks Bubble sort example
+# 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

@@ -1,7 +1,17 @@
 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*log n)
+
+Average Time Complexity [Big-theta]: O(n*log n)
+
+Space Complexity: O(n*log n)
+'''
 
 # Based off of Geeks for Geeks Bubble sort example
+# Another source: https://www.studytonight.com/data-structures/quick-sort
 def QuickSort(data, low, high, drawDataArray, sortSpeedTime):
 
     #Base Case