ecki/Mastering-Python-2e-exercises
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Update solution_01.py

Browse Source 
format
This commit is contained in:
2022WPJ 2022-10-07 16:40:51 +08:00 committed by GitHub
parent 3b8781da03
commit 69741bc6f3
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 12 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

16
CH_05_functional_programming/exercise_01/solution_01.py
View File

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