Wed May 24 09:36:00 UTC 2023 inscode

quicksort.py

+def quicksort(lis):
+    """
+    使用快速排序算法对列表进行排序
+    """
+    if len(lis) <= 1:
+        return lis
+    else:
+        pivot = lis[0]
+        less = [num for num in lis[1:] if num <= pivot]
+        greater = [num for num in lis[1:] if num > pivot]
+        return quicksort(less) + [pivot] + quicksort(greater)
+def test_quicksort():
+    print("开始测试:")
+    assert quicksort([3, 1, 4, 1, 5, 9, 2, 6, 5, 3, 5]) == [1, 1, 2, 3, 3, 4, 5, 5, 5, 6, 9]
+    assert quicksort([1, 2, 3]) == [1, 2, 3]
+    assert quicksort([3, 2, 1]) == [1, 2, 3]
+    assert quicksort([]) == []
+    assert quicksort([9]) == [9]
+    assert quicksort([9, 8, 7, 6, 5, 4, 3, 2, 1]) == [1, 2, 3, 4, 5, 6, 7, 8, 9]
+    
+    print("所有测试用例都通过了！")
+
+test_quicksort()