fork(2) download
copy 
  1. #SelectionSort - Usporiadanie vyberom
  2. pole = [10,7,5,15,3,8,9,5,10,3,1]
  3. n = len(pole)
  4.  
  5. for i in range(n-1): #najdi i-ty najmensi prvok
  6. 	#najdi index najmensieho prvku od i-tej pozicie
  7. 	ind_min = i
  8. 	for j in range(i+1, n): #skusaj zvysne prvky
  9. 		if pole[j] < pole[ind_min]: #nasiel sa mensi prvok?
  10. 			ind_min = j #zapamataj si poziciu noveho minima
  11. 	pole[i], pole[ind_min] = pole[ind_min], pole[i] #vymen dva prvky
  12. 	print(pole)
  13.  
  14.  
Success #stdin #stdout 0.02s 27704KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
[1, 7, 5, 15, 3, 8, 9, 5, 10, 3, 10]
[1, 3, 5, 15, 7, 8, 9, 5, 10, 3, 10]
[1, 3, 3, 15, 7, 8, 9, 5, 10, 5, 10]
[1, 3, 3, 5, 7, 8, 9, 15, 10, 5, 10]
[1, 3, 3, 5, 5, 8, 9, 15, 10, 7, 10]
[1, 3, 3, 5, 5, 7, 9, 15, 10, 8, 10]
[1, 3, 3, 5, 5, 7, 8, 15, 10, 9, 10]
[1, 3, 3, 5, 5, 7, 8, 9, 10, 15, 10]
[1, 3, 3, 5, 5, 7, 8, 9, 10, 15, 10]
[1, 3, 3, 5, 5, 7, 8, 9, 10, 10, 15]
https://ideone.com/4sgYny
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!