[Python-algorithm] python implements bubble, insert, and select sort

I have never systematically studied data structures and algorithms from the beginning.

 

[Python]
#-*-Coding: cp936 -*-
# Python insertion sorting
Def insertSort ():
For I in range (len (a)-1 ):
# Print a, I
For j in range (I + 1, len ()):
If a [I]> a [j]:
Temp = a [I]
A [I] = a [j]
A [j] = temp
Return
 
 
# Python Bubble Sorting
Def bubbleSort (alist ):
For passnum in range (len (alist)-1, 0,-1 ):
# Print alist, passnum
For I in range (passnum ):
If alist [I]> alist [I + 1]:
Temp = alist [I]
Alist [I] = alist [I + 1]
Alist [I + 1] = temp
Return alist
 
 
# Sorting by Python Selection
Def selectionSort (alist ):
For I in range (len (alist)-1, 0,-1 ):
Maxone = 0
For j in range (1, I + 1 ):
If alist [j]> alist [maxone]:
Maxone = j
Temp = alist [I]
Alist [I] = alist [maxone]
Alist [maxone] = temp
Return alist
 
 
Alist = [54,26, 93,17, 77,31, 44,55, 20]
# Print bubbleSort (alist)
Alist = [54,26, 93,17, 77,31, 44,55, 20]
Print selectionSort (alist)

#-*-Coding: cp936 -*-
# Python insertion sorting
Def insertSort ():
For I in range (len (a)-1 ):
# Print a, I
For j in range (I + 1, len ()):
If a [I]> a [j]:
Temp = a [I]
A [I] = a [j]
A [j] = temp
Return

# Python Bubble Sorting
Def bubbleSort (alist ):
For passnum in range (len (alist)-1, 0,-1 ):
# Print alist, passnum
For I in range (passnum ):
If alist [I]> alist [I + 1]:
Temp = alist [I]
Alist [I] = alist [I + 1]
Alist [I + 1] = temp
Return alist

# Sorting by Python Selection
Def selectionSort (alist ):
For I in range (len (alist)-1, 0,-1 ):
Maxone = 0
For j in range (1, I + 1 ):
If alist [j]> alist [maxone]:
Maxone = j
Temp = alist [I]
Alist [I] = alist [maxone]
Alist [maxone] = temp
Return alist

Alist = [54,26, 93,17, 77,31, 44,55, 20]
# Print bubbleSort (alist)
Alist = [54,26, 93,17, 77,31, 44,55, 20]
Print selectionSort (alist)