python非整数列表排序

'a' < 'z'
#True
'a' > 'z'
#False

def BubbleSort(arr):
    n = len(arr)
    for i in range(n):
        for j in range(0, n-i-1):
            if arr[j] > arr[j+1] : #进行比较
                arr[j], arr[j+1] = arr[j+1], arr[j] #如果为真则交换位置

arr = ['d','b','a','c']
BubbleSort(arr) 

print (arr) # ['a','b','c','d']

• 首先考虑元素数量为2的情况,在判断之后按顺序返回

def contrast(arr):
    for i in arr[0]:
        for j in arr[1]:
            if i == j:
                break
            return [arr[i>j], arr[i

arr = ['cde', 'abc']
contrast(arr) # ['abc', 'bcd']

def QuickSort(arr):
    for i in range(len(arr)):
        for j in range(1,len(arr)):
            arr[i], arr[j] = contrast([arr[i],arr[j]])
    return arr

arr = ['cde', 'abc','bcd']
QuickSort(arr) # ['abc', 'cde', 'bcd']