Analisis de algoritmos

 Selection sort: a = [0,3,2,6,1,5,9,4,8,7] for i in range(0, len(a) - 1):     c_min = i     for j in range(i + 1, len(a)):         if a[j] < a[c_min]:             c_min = j                  a[i], a[c_min] = a[c_min], a[i]      print(a)

 Insertion sort: a = [7,4,8,1,5,9,2,6,3] for i in range(1, len(a)):     key = a[i]     j = i - 1          while j >= 0 and a[j] > key:         a[j + 1] = a[j]         j -= 1     a[j + 1] = key          print(a)