__author__ = 'zhouhai'
'''简单选择排序,每趟循环只能确定一个元素排序后的定位。
我们可以考虑改进为每趟循环确定两个元素(当前趟最大和最小记录)的位置,从而减少排序所需的循环次数。
改进后对n个数据进行排序,最多只需进行[n/2]趟循环即可'''
import math
def SelectSort(numbers):
if len(numbers) <= 1:
return numbers
#先从前2个数字里面选择最小的
min_number = numbers[0]
if numbers[1] < numbers[0]:
min_number = numbers[1]
lenght = len(numbers)
n = int(lenght/2)
m = 0
while m < n:
#遍历一遍以后,最大的数会跑到最后面,最小的数会跑到最前面
for i in range(0+m,lenght-1-m) :
if numbers[i] > numbers[i+1]:
temp = numbers[i]
numbers[i] = numbers[i+1]
numbers[i+1] = temp
if numbers[i] < min_number:
min_number = numbers[i]
numbers[i] = numbers[0+m]
numbers[0+m] = min_number
m += 1
min_number = numbers[m]
if numbers[m] > numbers[m+1]:
min_number = numbers[m+1]
print(numbers)
return numbers
if __name__ =='__main__':
numbers = [78,11,31,23,34,345,1,4,5,4,9,8,7,8]
print(SelectSort(numbers))
'''简单选择排序,每趟循环只能确定一个元素排序后的定位。
我们可以考虑改进为每趟循环确定两个元素(当前趟最大和最小记录)的位置,从而减少排序所需的循环次数。
改进后对n个数据进行排序,最多只需进行[n/2]趟循环即可'''
import math
def SelectSort(numbers):
if len(numbers) <= 1:
return numbers
#先从前2个数字里面选择最小的
min_number = numbers[0]
if numbers[1] < numbers[0]:
min_number = numbers[1]
lenght = len(numbers)
n = int(lenght/2)
m = 0
while m < n:
#遍历一遍以后,最大的数会跑到最后面,最小的数会跑到最前面
for i in range(0+m,lenght-1-m) :
if numbers[i] > numbers[i+1]:
temp = numbers[i]
numbers[i] = numbers[i+1]
numbers[i+1] = temp
if numbers[i] < min_number:
min_number = numbers[i]
numbers[i] = numbers[0+m]
numbers[0+m] = min_number
m += 1
min_number = numbers[m]
if numbers[m] > numbers[m+1]:
min_number = numbers[m+1]
print(numbers)
return numbers
if __name__ =='__main__':
numbers = [78,11,31,23,34,345,1,4,5,4,9,8,7,8]
print(SelectSort(numbers))