####
Worst-case time complexity is the maximum amount of time an algorithm can take for any input of size n, best-case time complexity is the minimum amount of time an algorithm can take for any input of size n, and average-case time complexity is the expected amount of time an algorithm takes for any input of size n