Sorting algorithms/Selection sort: Difference between revisions

Content deleted Content added
Line 484:
<lang python>def selectionSort(lst):
for i in range(0,len(lst)-1):
mn = min(range(i,len(lst)), key=lst.__getitem__)
for j in range(i+1,len(lst)):
if lst[j] < lst[mn]:
mn = j
lst[i],lst[mn] = lst[mn],lst[i]
return lst</lang>
 
=={{header|R}}==
For loop: