修改命名与结构，让代码更加 Pythonic

Author: EINDEX

Diff for: Search/__init__.py

@@ -0,0 +1,6 @@
+def linear_search(arr, key):
+    """顺序(线性)查找算法实现"""
+    for index, value in enumerate(arr):
+        # 寻找目标
+        if value == key:
+            return index

Diff for: Search/linear_search.py

@@ -0,0 +1,29 @@
+#!/usr/bin/env python3
+# -*- coding: utf-8 -*-
+
+"""冒泡排序 """
+
+
+def bubble_sort(arr):
+    length = len(arr)
+    for index in range(length):
+        for j in range(1, length - index):
+            if arr[j - 1] > arr[j]:
+                # 交换两者数据，这里没用temp是因为python 特性元组。
+                arr[j - 1], arr[j] = arr[j], arr[j - 1]
+    return arr
+
+
+def bubble_sort_flag(arr):
+    length = len(arr)
+    for index in range(length):
+        # 标志位
+        flag = True
+        for j in range(1, length - index):
+            if arr[j - 1] > arr[j]:
+                arr[j - 1], arr[j] = arr[j], arr[j - 1]
+                flag = False
+        if flag:
+            # 没有发生交换，直接返回list
+            return arr
+    return arr

Diff for: Sort/bubble_sort.py

@@ -0,0 +1,23 @@
+#!/usr/bin/env python3
+# -*- coding: utf-8 -*-
+
+
+def count_sort(arr):
+    min_num = 2147483647
+    max_num = 0
+    # 第一步 取得最大值和最小值
+    for x in arr:
+        if x < min_num:
+            min_num = x
+        if x > max_num:
+            max_num = x
+    # 创建数组C
+    count = [0] * (max_num - min_num +1)
+    for index in arr:
+        count[index - min_num] += 1
+    index = 0
+    for a in range(max_num - min_num+1):
+        for c in range(count[a]):
+            arr[index] = a + min_num
+            index += 1
+    return arr

Diff for: Sort/count_sort.py

@@ -0,0 +1,30 @@
+#!/usr/bin/env python3
+# -*- coding: utf-8 -*-
+
+
+def heap_sort(arr):
+    # 创建最大堆
+    for start in range((len(arr) - 2) // 2, -1, -1):
+        sift_down(arr, start, len(arr) - 1)
+
+    # 堆排序
+    for end in range(len(arr) - 1, 0, -1):
+        arr[0], arr[end] = arr[end], arr[0]
+        sift_down(arr, 0, end - 1)
+    return arr
+
+
+# 最大堆调整
+def sift_down(arr, start, end):
+    root = start
+    while True:
+        child = 2 * root + 1
+        if child > end:
+            break
+        if child + 1 <= end and arr[child] < arr[child + 1]:
+            child += 1
+        if arr[root] < arr[child]:
+            arr[root], arr[child] = arr[child], arr[root]
+            root = child
+        else:
+            break

Diff for: Sort/heap_sort.py

@@ -0,0 +1,25 @@
+#!/usr/bin/env python3
+# -*- coding: utf-8 -*-
+
+
+def insert_sort(arr):
+    n = len(arr)
+    for i in range(1, n):
+        # 后一个元素和前一个元素比较
+        # 如果比前一个小
+        if arr[i] < arr[i - 1]:
+            # 将这个数取出
+            temp = arr[i]
+            # 保存下标
+            index = i
+            # 从后往前依次比较每个元素
+            for j in range(i - 1, -1, -1):
+                # 和比取出元素大的元素交换
+                if arr[j] > temp:
+                    arr[j + 1] = arr[j]
+                    index = j
+                else:
+                    break
+            # 插入元素
+            arr[index] = temp
+    return arr

Diff for: Sort/insert_sort.py

@@ -0,0 +1,32 @@
+#!/usr/bin/env python3
+# -*- coding: utf-8 -*-
+
+
+def merge_sort(arr):
+    # 认为长度不大于1的数列是有序的
+    if len(arr) <= 1:
+        return arr
+    # 二分列表
+    middle = len(arr) // 2
+    left = merge_sort(arr[:middle])
+    right = merge_sort(arr[middle:])
+    # 最后一次合并
+    return merge(left, right)
+
+
+# 合并
+def merge(left, right):
+    l, r = 0, 0
+    result = []
+    # 两个子数列比大小
+    while l < len(left) and r < len(right):
+        if left[l] < right[r]:
+            result.append(left[l])
+            l += 1
+        else:
+            result.append(right[r])
+            r += 1
+    # 填充结果
+    result += left[l:]
+    result += right[r:]
+    return result

Diff for: Sort/marge_sort.py

@@ -0,0 +1,38 @@
+#!/usr/bin/env python3
+# -*- coding: utf-8 -*-
+
+
+def quick_sort(arr):
+    less = []
+    pivot_list = []
+    more = []
+    # 递归出口
+    if len(arr) <= 1:
+        return arr
+    else:
+        # 将第一个值做为基准
+        pivot = arr[0]
+        for i in arr:
+            # 将比急转小的值放到less数列
+            if i < pivot:
+                less.append(i)
+            # 将比基准打的值放到more数列
+            elif i > pivot:
+                more.append(i)
+            # 将和基准相同的值保存在基准数列
+            else:
+                pivot_list.append(i)
+        # 对less数列和more数列继续进行排序
+        less = quick_sort(less)
+        more = quick_sort(more)
+        return less + pivot_list + more
+
+
+def qsort(arr):
+    if len(arr) <= 1:
+        return arr
+    else:
+        pivot = arr[0]
+        return qsort([x for x in arr[1:] if x < pivot]) + \
+               [pivot] + \
+               qsort([x for x in arr[1:] if x >= pivot])

Diff for: Sort/quick_sort.py

@@ -0,0 +1,18 @@
+#!/usr/bin/env python3
+# -*- coding: utf-8 -*-
+
+
+def selection_sort(arr):
+    n = len(arr)
+    # 遍历所有元素
+    for i in range(0, n):
+        # 获取最小元素的
+        min_num = i
+        # 遍历未排序元素
+        for j in range(i + 1, n):
+            # 找到一个比最小元素小的元素
+            if arr[j] < arr[min_num]:
+                min_num = j
+                # 交换数据
+        arr[min_num], arr[i] = arr[i], arr[min_num]
+    return arr

Diff for: Sort/selection_sort.py

@@ -0,0 +1,21 @@
+#!/usr/bin/env python3
+# -*- coding: utf-8 -*-
+
+
+def shell_sort(arr):
+    n = len(arr)
+    # 初始步长
+    gap = round(n / 2)
+    while gap > 0:
+        for i in range(gap, n):
+            # 每个步长进行插入排序
+            temp = arr[i]
+            j = i
+            # 插入排序
+            while j >= gap and arr[j - gap] > temp:
+                arr[j] = arr[j - gap]
+                j -= gap
+            arr[j] = temp
+        # 得到新的步长
+        gap = round(gap / 2)
+    return arr

Diff for: Sort/shell_sort.py

@@ -0,0 +1,9 @@
+from unittest import TestCase
+
+
+class TestSort(TestCase):
+
+    def test_bubble_sort(self):
+
+        self.fail()
+