使用Python完成排序（冒泡、选择、插入法）

 class Sort(object):

     @staticmethod
     def bubble_sort(ls):
         lenth = len(ls)
         if lenth == 0:
             return []
         while lenth:
             for i in range(lenth-1):
                 if ls[i] > ls[i+1]:
                     ls[i], ls[i+1] = ls[i+1], ls[i]
             lenth -= 1
         return ls

     @staticmethod
     def select_sort(ls):
         if not ls:
             return []
         lenth = len(ls)
         i = 0
         while i < lenth-1:
             min_v = ls[i]
             for n in range(i+1, lenth):
                 if ls[n] < min_v:
                     loc, min_v = n, ls[n]
             if ls[i] != min_v:
                 ls[i], ls[loc] = ls[loc], ls[i]
             i += 1
         return ls
 #以下有错误，当时没注意
 #    @staticmethod
 #    def insert_sort(ls):
 #        if not ls:
 #            return []
 #        i = 1
 #        lenth = len(ls)
 #        while i < lenth:
 #            for n in range(0, i):
 #                if ls[n] > ls[n+1]:
 #                    ls[n], ls[n+1] = ls[n+1], ls[n]
 #            i += 1
 #        return ls
 #更正如下：

     @staticmethod
     def insert_sort(ls):
         if not ls:
             return []
         i =
         lenth = len(ls)
         while i < lenth:
             tmp = ls[i]
             for n in range(i, , -):
                 if tmp < ls[n-]:
                     ls[n] = ls[n-] #the smaller ahead
                 else:
                     ls[n] = tmp
                     break
             i +=
         return ls

     @staticmethod
     def shell_sort(ls):
         if not ls:
             return []
         lenth = len(ls)
         increment = lenth //
         while increment > : # stop the loop when increment =
             loc = increment # start from location increment
             while loc < lenth:
                 tmp = ls[loc]
                 for i in range(loc, increment-, -increment):
                     if tmp < ls[i-increment]:   #if large than the value in loc
                         ls[i] = ls[i-increment] # move to the next location
                     else:
                         break
                 ls[i] = tmp # move the value in loc to location i
                 loc +=  # loop from increment to the last of ls
             increment //= 2
         return ls # this method allow sb. to sort the ls in different increment

 if __name__ == '__main__':
     ls = [1, 9, 5, 4, 3, 7, 6]
     s = Sort()
     print(s.bubble_sort(ls[:]))
     print(s.select_sort(ls[:]))
     print(s.insert_sort(ls[:]))
53     print(s.shell_sort(ls[:]))

可知：

1. 冒泡排序是将最大值（最小值）通过相邻交换到行尾（行首）；
2. 选择排序是选出最大值（最小值）放到行尾（行首）；
3. 插入排序是通过相邻交换将下一个数插入到已经排好序的序列中。
4. 希尔排序与3相近，但通过设置间隔分别排序，直到间隔为1完成排序。