1 class Solution:
2     """
3     @param: A: an integer array
4     @return:
5     """
6     def sortIntegers(self, A):
7         A.sort()

1 sorted([5, 2, 3, 1, 4])
2 [1, 2, 3, 4, 5]

1 sorted({1: 'D', 2: 'B', 3: 'B', 4: 'E', 5: 'A'})
2 [1, 2, 3, 4, 5]

 1 def insert_sort(lists):
 2     # 插入排序
 3     count = len(lists)
 4     for i in range(1, count):
 5         key = lists[i]
 6         j = i - 1
 7         while j >= 0:
 8             if lists[j] > key:
 9                 lists[j + 1] = lists[j]
10                 lists[j] = key
11             j -= 1
12     return lists

 1 def shell_sort(lists):
 2     # 希尔排序
 3     count = len(lists)
 4     step = 2
 5     group = count / step
 6     while group > 0:
 7         for i in range(0, group):
 8             j = i + group
 9             while j < count:
10                 k = j - group
11                 key = lists[j]
12                 while k >= 0:
13                     if lists[k] > key:
14                         lists[k + group] = lists[k]
15                         lists[k] = key
16                     k -= group
17                 j += group
18         group /= step
19     return lists

1 def bubble_sort(lists):
2     # 冒泡排序
3     count = len(lists)
4     for i in range(0, count):
5         for j in range(i + 1, count):
6             if lists[i] > lists[j]:
7                 lists[i], lists[j] = lists[j], lists[i]
8     return lists

 1 def quick_sort(lists, left, right):
 2     # 快速排序
 3     if left >= right:
 4         return lists
 5     key = lists[left]
 6     low = left
 7     high = right
 8     while left < right:
 9         while left < right and lists[right] >= key:
10             right -= 1
11         lists[left] = lists[right]
12         while left < right and lists[left] <= key:
13             left += 1
14         lists[right] = lists[left]
15     lists[right] = key
16     quick_sort(lists, low, left - 1)
17     quick_sort(lists, left + 1, high)
18     return lists

 1 def select_sort(lists):
 2     # 选择排序
 3     count = len(lists)
 4     for i in range(0, count):
 5         min = i
 6         for j in range(i + 1, count):
 7             if lists[min] > lists[j]:
 8                 min = j
 9         lists[min], lists[i] = lists[i], lists[min]
10     return lists