Advertisement
Guest User

Untitled

a guest
May 25th, 2019
65
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.68 KB | None | 0 0
  1. import random
  2.  
  3. def quicksort(arr: list, low: int, high: int):
  4. if (low < high):
  5. pivot = partition(arr, low, high)
  6.  
  7. quicksort(arr, low, pivot - 1)
  8. quicksort(arr, pivot + 1, high)
  9.  
  10. pass
  11.  
  12. def partition(arr: list, low: int, high: int):
  13. pivot = arr[high]
  14. i = low - 1
  15.  
  16. for j in range(low, high):
  17. if arr[j] <= pivot:
  18. i += 1
  19. arr[i], arr[j] = arr[j], arr[i]
  20.  
  21. arr[i + 1], arr[high] = arr[high], arr[i + 1]
  22. return i + 1
  23.  
  24. if __name__ == '__main__':
  25. randomList = [random.randint(1, 100) for x in range(100)]
  26. print(randomList)
  27.  
  28. quicksort(randomList, 0, len(randomList) - 1)
  29.  
  30. print(randomList)
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement