#CoctailSort pole = [10,7,5,15,3,8,9,5,10,3,1] n = len(pole) bola_vymena = True while bola_vymena: # bola_vymena == True #jeden prechod polom ZLAVA bola_vymena = False for j in range(n-1): # prvky od nula po n-2 (predposledny) if pole[j] > pole[j+1]: #vymen, ak su v zlom poradi pole[j], pole[j+1] = pole[j+1], pole[j] bola_vymena = True #jeden prechod polom SPRAVA bola_vymena = False for j in range(n-1, 0, -1): # prvky od n-1 po 1 (druhy) if pole[j] < pole[j-1]: #vymen, ak su v zlom poradi pole[j], pole[j-1] = pole[j-1], pole[j] bola_vymena = True print(pole)
Standard input is empty
[1, 7, 5, 10, 3, 8, 9, 5, 10, 3, 15] [1, 3, 5, 7, 3, 8, 9, 5, 10, 10, 15] [1, 3, 3, 5, 5, 7, 8, 9, 10, 10, 15] [1, 3, 3, 5, 5, 7, 8, 9, 10, 10, 15]