# Algoritmi di ordinamento def selection_sort(seq): for i in range(len(seq)-1): imin = i for j in range(i+1,len(seq)): if seq[j] < seq[imin]: imin = j seq[i], seq[imin]

= seq[imin],seq[i] def insertion_sort(seq): for i in range(1,len(seq)): seq_i = seq[i] j=i while j>0 and seq[j-1] > seq_i: seq[j] = seq[j-1] j-=1 seq[j]=seq_i def bubble_sort(seq): i,swap_test=0,True while swap_test and i<len(seq)-1: swap_test = False for j in range(len(seq)-i-1): if seq[j]>seq[j+1]: seq[j],seq[j+1] =seq[j+1],seq[j] swap_test = True i+=1