mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-01-19 00:37:02 +00:00
Code Issues Packages Projects Releases Wiki Activity

optimization (#1303)

Browse Source
This commit is contained in:
Du YuanChao 2019-10-08 16:25:00 +08:00 committed by Christian Clauss
parent f0568d642e
commit e80d248e65
1 changed files with 2 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
sorts/selection_sort.py
View File

@ -35,7 +35,8 @@ def selection_sort(collection):
for k in range(i + 1, length): for k in range(i + 1, length):
if collection[k] < collection[least]: if collection[k] < collection[least]:
least = k least = k
collection[least], collection[i] = (collection[i], collection[least]) if least != i:
collection[least], collection[i] = (collection[i], collection[least])
return collection return collection