fork(1) download
copy 
  1. #InsertSort - Usporiadanie vkladanim
  2. pole = [10,7,5,15,3,8,9,5,10,3,1]
  3. n = len(pole)
  4.  
  5. for i in range(1, n):
  6. 	#pridaj prvok na indexe i do uz usporiadenej postupnosti pole[0..i-1]
  7. 	j = i
  8. 	while j > 0 and pole[j-1] > pole[j]: #ak je nalavo vacsi prvok
  9. 		pole[j-1], pole[j] = pole[j], pole[j-1] #prebuble dolava
  10. 		j -= 1
  11. 	print(pole)
  12.  
Success #stdin #stdout 0.01s 27656KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
[7, 10, 5, 15, 3, 8, 9, 5, 10, 3, 1]
[5, 7, 10, 15, 3, 8, 9, 5, 10, 3, 1]
[5, 7, 10, 15, 3, 8, 9, 5, 10, 3, 1]
[3, 5, 7, 10, 15, 8, 9, 5, 10, 3, 1]
[3, 5, 7, 8, 10, 15, 9, 5, 10, 3, 1]
[3, 5, 7, 8, 9, 10, 15, 5, 10, 3, 1]
[3, 5, 5, 7, 8, 9, 10, 15, 10, 3, 1]
[3, 5, 5, 7, 8, 9, 10, 10, 15, 3, 1]
[3, 3, 5, 5, 7, 8, 9, 10, 10, 15, 1]
[1, 3, 3, 5, 5, 7, 8, 9, 10, 10, 15]
https://ideone.com/e2oDi3
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!