mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-03-27 17:06:44 +00:00
Code Issues Packages Projects Releases Wiki Activity

Optimised for loop iteration

Browse Source
This commit is contained in:
YasirChoudhary 2018-10-07 14:33:56 +05:30
parent 6a6349bdb0
commit 98cc298e61
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
sorts/selection_sort.py
View File

@ -31,7 +31,7 @@ def selection_sort(collection):
""" """
length = len(collection) length = len(collection)
for i in range(length): for i in range(length - 1):
least = i least = i
for k in range(i + 1, length): for k in range(i + 1, length):
if collection[k] < collection[least]: if collection[k] < collection[least]: