# the worst time complexity is O(n^2), the best is O(n)
def insertSort(a):
# from the second element
for i in range(1, len(a)):
key = a[i]
...
# the worst time complexity is O(n^2), the best is O(n)