mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2024-12-18 01:00:15 +00:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #2 from H-Darji/master

Browse Source 
Improvement
This commit is contained in:
Chetan Kaushik 2016-07-28 23:01:14 +05:30 committed by GitHub
commit adc008ff70
1 changed files with 8 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
SelectionSort.py
View File

@ -1,4 +1,3 @@
print ("Enter numbers seprated by comma ")
def selectionsort( aList ): def selectionsort( aList ):
for i in range( len( aList ) ): for i in range( len( aList ) ):
least = i least = i
@ -6,9 +5,16 @@ def selectionsort( aList ):
if aList[k] < aList[least]: if aList[k] < aList[least]:
least = k least = k
swap( aList, least, i ) aList = swap( aList, least, i )
print(aList)
def swap( A, x, y ): def swap( A, x, y ):
tmp = A[x] tmp = A[x]
A[x] = A[y] A[x] = A[y]
A[y] = tmp A[y] = tmp
return A
print ("Enter numbers seprated by comma ")
response = input()
aList = list(response.split(','))
selectionsort(aList)