快速排序
class Solution1:
def quick_sort(self,arr):
if len(arr) < 2:
return arr
else:
first_one = arr[0]
less_part = [i for i in arr[1:] if i < first_one]
greater_part = [i for i in arr[1:] if i >= first_one]
return self.quick_sort(less_part) + [first_one] + self.quick_sort(greater_part)
插入排序
class Solution2:
def insert_sort(self, list):
for index in range(1,len(list)):
curent_value = list[index]
i = index-1
while i>=0:
if curent_value<list[i]:
list[i+1] = list[i]
list[i] = curent_value
i = i-1
else:
break
return list