Update solution_01.py

format

CH_05_functional_programming/exercise_01/solution_01.py

@@ -2,6 +2,10 @@ import random
 
 
 def quicksort(nums, left=None, right=None):
+    if left is None:
+        left = 0
+    if right is None:
+        right = len(nums) - 1
     if right <= left:
         return
     j = left
@@ -16,6 +20,10 @@ def quicksort(nums, left=None, right=None):
     return nums
 
 
+def main():
+    nums = random.sample(range(100000), 100000)
+    assert sorted(nums) == quicksort(nums)
+
+
 if __name__ == '__main__':
-    nums = [random.randint(1, 100000) for _ in range(10000)]
-    assert sorted(nums) == quicksort(nums, 0, len(nums)-1)
+    main()