fork(1) download
copy 
  1. #CoctailSort
  2. pole = [10,7,5,15,3,8,9,5,10,3,1]
  3. n = len(pole)
  4.  
  5. bola_vymena = True
  6. while bola_vymena: # bola_vymena == True
  7. 	#jeden prechod polom ZLAVA
  8. 	bola_vymena = False
  9. 	for j in range(n-1): # prvky od nula po n-2 (predposledny)
  10. 		if pole[j] > pole[j+1]: #vymen, ak su v zlom poradi
  11. 			pole[j], pole[j+1] = pole[j+1], pole[j]
  12. 			bola_vymena = True
  13. 	#jeden prechod polom SPRAVA
  14. 	bola_vymena = False
  15. 	for j in range(n-1, 0, -1): # prvky od n-1 po 1 (druhy)
  16. 		if pole[j] < pole[j-1]: #vymen, ak su v zlom poradi
  17. 			pole[j], pole[j-1] = pole[j-1], pole[j]
  18. 			bola_vymena = True
  19.  
  20.  
  21. 	print(pole)
Success #stdin #stdout 0.02s 27712KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
[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]
https://ideone.com/hk92DR
language:
Python 3 (python  3.9.5)
created:
5 years ago
visibility:
secret

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!