'sort'

Author: EINDEX

Diff for: .idea/dictionaries/snows.xml

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

Diff for: .idea/misc.xml

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

Diff for: .idea/modules.xml

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

Diff for: .idea/sort.iml

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

Diff for: .idea/workspace.xml

@@ -0,0 +1,31 @@
+#!/usr/bin/env python3
+# -*- coding: utf-8 -*-
+
+def merge_sort(list):
+    # 认为长度不大于1的数列是有序的
+    if len(list) <= 1:
+        return list
+    # 二分列表
+    middle = len(list) // 2
+    left = merge_sort(list[:middle])
+    right = merge_sort(list[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/BubbleSort.py

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

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

Diff for: Sort/HeapSort.py

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

Diff for: Sort/InsertSort.py

@@ -0,0 +1,6 @@
+#!/usr/bin/env python3
+# -*- coding: utf-8 -*-
+
+'''a test module '''
+
+__author__ = 'EINDEX'

Diff for: Sort/MargeSort.py

@@ -0,0 +1,47 @@
+#!/usr/bin/env python3
+# -*- coding: utf-8 -*-
+
+'''测试函数 '''
+import random
+import time
+
+from Sort.BubbleSort import bubble_sort, bubble_sort_flag
+from Sort.CountSort import count_sort
+from Sort.HeapSort import heap_sort
+from Sort.InsertSort import insert_sort
+from Sort.MargeSort import merge_sort
+from Sort.QuickSort import quick_sort, qsort
+from Sort.SelectionSort import selection_sort
+from Sort.ShellSort import shell_sort
+import sys
+
+# 开挂 防止栈溢出
+sys.setrecursionlimit(99999)
+
+#整数数列
+# L = [int(random.uniform(0, 5000)) for x in range(1000)]
+# 浮点数列
+L = [random.uniform(0, 5000) for x in range(1000)]
+
+current = list(L)
+current.sort()
+
+def compile(fun):
+    l = list(L)
+    start=time.time()
+    res = fun(l)
+    over = time.time()
+    print('time:'+str(over-start),current == res, fun.__name__)
+
+
+compile(selection_sort)
+compile(bubble_sort)
+compile(bubble_sort_flag)
+compile(insert_sort)
+compile(merge_sort)
+compile(shell_sort)
+compile(quick_sort)
+compile(qsort)
+compile(heap_sort)
+if isinstance(L[0],int):
+    compile(count_sort)