prompt: We are currently solving the following issue within our repository. Here is the issue text:
  --- BEGIN ISSUE ---
  sorts/random_normal_distribution_quicksort.py has no tests
  ### Repository commit
  
  3
  
  ### Python version (python --version)
  
  Python 3.11.5
  
  ### Dependencies version (pip freeze)
  
  Numpy
  
  ### Expected behavior
  
  Tests.
  
  ### Actual behavior
  
  No tests.
  
  --- END ISSUE ---
  
  Below are some code segments, each from a relevant file. One or more of these files may contain bugs.
  --- BEGIN FILES ---
  Path: `sorts/random_pivot_quick_sort.py`
  Content:
  ```
  1 """
  2 Picks the random index as the pivot
  3 """
  4 import random
  5 
  6 
  7 def partition(a, left_index, right_index):
  8     pivot = a[left_index]
  9     i = left_index + 1
  10     for j in range(left_index + 1, right_index):
  11         if a[j] < pivot:
  12             a[j], a[i] = a[i], a[j]
  13             i += 1
  14     a[left_index], a[i - 1] = a[i - 1], a[left_index]
  15     return i - 1
  16 
  17 
  18 def quick_sort_random(a, left, right):
  19     if left < right:
  20         pivot = random.randint(left, right - 1)
  21         a[pivot], a[left] = (
  22             a[left],
  23             a[pivot],
  24         )  # switches the pivot with the left most bound
  25         pivot_index = partition(a, left, right)
  26         quick_sort_random(
  27             a, left, pivot_index
  28         )  # recursive quicksort to the left of the pivot point
  29         quick_sort_random(
  30             a, pivot_index + 1, right
  31         )  # recursive quicksort to the right of the pivot point
  32 
  33 
  34 def main():
  35     user_input = input("Enter numbers separated by a comma:\n").strip()
  36     arr = [int(item) for item in user_input.split(",")]
  37 
  38     quick_sort_random(arr, 0, len(arr))
  39 
  40     print(arr)
  41 
  42 
  43 if __name__ == "__main__":
  44     main()
  45
  ```
  --- END FILES ---
  
  Please first localize the bug based on the issue statement, and then generate a patch according to the `git diff` format fenced by three backticks.
  
  Here is an example:
  
  ```diff
  diff --git a/examples/server_async.py b/examples/server_async.py
  --- a/examples/server_async.py
  +++ b/examples/server_async.py
  @@ -313,4 +313,4 @@
   
   
   if __name__ == "__main__":
  -    asyncio.run(run_async_server("."), debug=True)
  +    asyncio.run(run_async_server(), debug=True)
  diff --git a/examples/server_sync.py b/examples/server_sync.py
  --- a/examples/server_sync.py
  +++ b/examples/server_sync.py
  @@ -313,5 +313,5 @@
   
   
   if __name__ == "__main__":
  -    server = run_sync_server(".")
  +    server = run_sync_server()
       server.shutdown()
  
  ```
  
golden_diff: diff --git a/sorts/random_pivot_quick_sort.py b/sorts/random_pivot_quick_sort.py
  deleted file mode 100644
  --- a/sorts/random_pivot_quick_sort.py
  +++ /dev/null
  @@ -1,44 +0,0 @@
  -"""
  -Picks the random index as the pivot
  -"""
  -import random
  -
  -
  -def partition(a, left_index, right_index):
  -    pivot = a[left_index]
  -    i = left_index + 1
  -    for j in range(left_index + 1, right_index):
  -        if a[j] < pivot:
  -            a[j], a[i] = a[i], a[j]
  -            i += 1
  -    a[left_index], a[i - 1] = a[i - 1], a[left_index]
  -    return i - 1
  -
  -
  -def quick_sort_random(a, left, right):
  -    if left < right:
  -        pivot = random.randint(left, right - 1)
  -        a[pivot], a[left] = (
  -            a[left],
  -            a[pivot],
  -        )  # switches the pivot with the left most bound
  -        pivot_index = partition(a, left, right)
  -        quick_sort_random(
  -            a, left, pivot_index
  -        )  # recursive quicksort to the left of the pivot point
  -        quick_sort_random(
  -            a, pivot_index + 1, right
  -        )  # recursive quicksort to the right of the pivot point
  -
  -
  -def main():
  -    user_input = input("Enter numbers separated by a comma:\n").strip()
  -    arr = [int(item) for item in user_input.split(",")]
  -
  -    quick_sort_random(arr, 0, len(arr))
  -
  -    print(arr)
  -
  -
  -if __name__ == "__main__":
  -    main()
  
verification_info: {"golden_diff": "diff --git a/sorts/random_pivot_quick_sort.py b/sorts/random_pivot_quick_sort.py\ndeleted file mode 100644\n--- a/sorts/random_pivot_quick_sort.py\n+++ /dev/null\n@@ -1,44 +0,0 @@\n-\"\"\"\r\n-Picks the random index as the pivot\r\n-\"\"\"\r\n-import random\r\n-\r\n-\r\n-def partition(a, left_index, right_index):\r\n-    pivot = a[left_index]\r\n-    i = left_index + 1\r\n-    for j in range(left_index + 1, right_index):\r\n-        if a[j] < pivot:\r\n-            a[j], a[i] = a[i], a[j]\r\n-            i += 1\r\n-    a[left_index], a[i - 1] = a[i - 1], a[left_index]\r\n-    return i - 1\r\n-\r\n-\r\n-def quick_sort_random(a, left, right):\r\n-    if left < right:\r\n-        pivot = random.randint(left, right - 1)\r\n-        a[pivot], a[left] = (\r\n-            a[left],\r\n-            a[pivot],\r\n-        )  # switches the pivot with the left most bound\r\n-        pivot_index = partition(a, left, right)\r\n-        quick_sort_random(\r\n-            a, left, pivot_index\r\n-        )  # recursive quicksort to the left of the pivot point\r\n-        quick_sort_random(\r\n-            a, pivot_index + 1, right\r\n-        )  # recursive quicksort to the right of the pivot point\r\n-\r\n-\r\n-def main():\r\n-    user_input = input(\"Enter numbers separated by a comma:\\n\").strip()\r\n-    arr = [int(item) for item in user_input.split(\",\")]\r\n-\r\n-    quick_sort_random(arr, 0, len(arr))\r\n-\r\n-    print(arr)\r\n-\r\n-\r\n-if __name__ == \"__main__\":\r\n-    main()\n", "issue": "sorts/random_normal_distribution_quicksort.py has no tests\n### Repository commit\n\n3\n\n### Python version (python --version)\n\nPython 3.11.5\n\n### Dependencies version (pip freeze)\n\nNumpy\n\n### Expected behavior\n\nTests.\n\n### Actual behavior\n\nNo tests.\n", "before_files": [{"content": "\"\"\"\r\nPicks the random index as the pivot\r\n\"\"\"\r\nimport random\r\n\r\n\r\ndef partition(a, left_index, right_index):\r\n    pivot = a[left_index]\r\n    i = left_index + 1\r\n    for j in range(left_index + 1, right_index):\r\n        if a[j] < pivot:\r\n            a[j], a[i] = a[i], a[j]\r\n            i += 1\r\n    a[left_index], a[i - 1] = a[i - 1], a[left_index]\r\n    return i - 1\r\n\r\n\r\ndef quick_sort_random(a, left, right):\r\n    if left < right:\r\n        pivot = random.randint(left, right - 1)\r\n        a[pivot], a[left] = (\r\n            a[left],\r\n            a[pivot],\r\n        )  # switches the pivot with the left most bound\r\n        pivot_index = partition(a, left, right)\r\n        quick_sort_random(\r\n            a, left, pivot_index\r\n        )  # recursive quicksort to the left of the pivot point\r\n        quick_sort_random(\r\n            a, pivot_index + 1, right\r\n        )  # recursive quicksort to the right of the pivot point\r\n\r\n\r\ndef main():\r\n    user_input = input(\"Enter numbers separated by a comma:\\n\").strip()\r\n    arr = [int(item) for item in user_input.split(\",\")]\r\n\r\n    quick_sort_random(arr, 0, len(arr))\r\n\r\n    print(arr)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n    main()\r\n", "path": "sorts/random_pivot_quick_sort.py"}], "after_files": [{"content": null, "path": "sorts/random_pivot_quick_sort.py"}]}