你可以这样做不同类型的排序技术。这种技术称为Bubble Sort
和复杂度为O(n^2)
def bubbleSort(a):
update=True
while(update):
update = False
for i in range(len(a)-1):
if a[i]>a[i+1]:
a[i],a[i+1]=a[i+1],a[i]
update = True
return a
您还可以通过快速排序的技术使用复杂O(nlogn)
。详细说明在这里Quick Sort
def quickSort(alist):
quickSortHelper(alist,0,len(alist)-1)
def quickSortHelper(alist,first,last):
if first<last:
splitpoint = partition(alist,first,last)
quickSortHelper(alist,first,splitpoint-1)
quickSortHelper(alist,splitpoint+1,last)
def partition(alist,first,last):
pivotvalue = alist[first]
leftmark = first+1
rightmark = last
done = False
while not done:
while leftmark <= rightmark and \
alist[leftmark] <= pivotvalue:
leftmark = leftmark + 1
while alist[rightmark] >= pivotvalue and \
rightmark >= leftmark:
rightmark = rightmark -1
if rightmark < leftmark:
done = True
else:
temp = alist[leftmark]
alist[leftmark] = alist[rightmark]
alist[rightmark] = temp
temp = alist[first]
alist[first] = alist[rightmark]
alist[rightmark] = temp
return rightmark
alist = [54,26,93,17,77,31,44,55,20]
quickSort(alist)
print(alist)
那么你的代码有什么问题? – Kasramvd
你为什么要“不使用sort”排序?要理解它背后的算法,以避免错误的功能? – Jiby
@Jiby - 这通常是面试风格的问题......在这种情况下不太确定。但你有一个非常有效的问题在您的评论... – Lix